- : unit = ()
h : heuristic = <heuristic>
- : unit = ()
APPLY CRITERIA (Marked dependency pairs)

TRS termination of:
[1] U11(tt,M,N) -> U12(tt,activate(M),activate(N))
[2] U12(tt,M,N) -> s(plus(activate(N),activate(M)))
[3] plus(N,0) -> N
[4] plus(N,s(M)) -> U11(tt,M,N)
[5] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_U11(tt,M,N) , Marked_U12(tt,activate(M),activate(N))>
<Marked_U11(tt,M,N) , Marked_activate(M)>
<Marked_U11(tt,M,N) , Marked_activate(N)>
<Marked_U12(tt,M,N) , Marked_plus(activate(N),activate(M))>
<Marked_U12(tt,M,N) , Marked_activate(N)>
<Marked_U12(tt,M,N) , Marked_activate(M)>
<Marked_plus(N,s(M)) , Marked_U11(tt,M,N)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_plus(N,s(M)) , Marked_U11(tt,M,N)> 
      --> <Marked_U11(tt,M,N) , Marked_U12(tt,activate(M),activate(N))>
  <Marked_U12(tt,M,N) , Marked_plus(activate(N),activate(M))> 
     --> <Marked_plus(N,s(M)) , Marked_U11(tt,M,N)>
  <Marked_U11(tt,M,N) , Marked_U12(tt,activate(M),activate(N))> 
     --> <Marked_U12(tt,M,N) , Marked_plus(activate(N),activate(M))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  U12(tt,M,N) >= s(plus(activate(N),activate(M))) ;
  activate(X) >= X ;
  U11(tt,M,N) >= U12(tt,activate(M),activate(N)) ;
  plus(N,s(M)) >= U11(tt,M,N) ;
  plus(N,0) >= N ;
  Marked_plus(N,s(M)) >= Marked_U11(tt,M,N) ;
  Marked_U11(tt,M,N) >= Marked_U12(tt,activate(M),activate(N)) ;
  Marked_U12(tt,M,N) >= Marked_plus(activate(N),activate(M)) ;
 }
 + Disjunctions:{ 
{
  Marked_plus(N,s(M)) > Marked_U11(tt,M,N) ;
 }
{
  Marked_U11(tt,M,N) > Marked_U12(tt,activate(M),activate(N)) ;
 }
{
  Marked_U12(tt,M,N) > Marked_plus(activate(N),activate(M)) ;
 }
 } 
=== TIMER virtual : 10.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 10.000000 ===
=== STOPING TIMER real ===
Sat solver returned
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: U12(tt,M,N) >= s(plus(activate(N),activate(M)))
constraint: activate(X) >= X
constraint: U11(tt,M,N) >= U12(tt,activate(M),activate(N))
constraint: plus(N,s(M)) >= U11(tt,M,N)
constraint: plus(N,0) >= N
constraint: Marked_plus(N,s(M)) >= Marked_U11(tt,M,N)
constraint: Marked_U11(tt,M,N) >= Marked_U12(tt,activate(M),activate(N))
constraint: Marked_U12(tt,M,N) >= Marked_plus(activate(N),activate(M))
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] U11(tt,M,N) -> U12(tt,activate(M),activate(N))
[2] U12(tt,M,N) -> s(plus(activate(N),activate(M)))
[3] plus(N,0) -> N
[4] plus(N,s(M)) -> U11(tt,M,N)
[5] activate(X) -> X
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_U11(tt,M,N) , Marked_U12(tt,activate(M),activate(N))>
<Marked_U11(tt,M,N) , Marked_activate(M)>
<Marked_U11(tt,M,N) , Marked_activate(N)>
<Marked_U12(tt,M,N) , Marked_plus(activate(N),activate(M))>
<Marked_U12(tt,M,N) , Marked_activate(N)>
<Marked_U12(tt,M,N) , Marked_activate(M)>
<Marked_plus(N,s(M)) , Marked_U11(tt,M,N)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_U11(tt,M,N) , Marked_U12(tt,activate(M),activate(N))>
<Marked_U12(tt,M,N) , Marked_plus(activate(N),activate(M))>
<Marked_plus(N,s(M)) , Marked_U11(tt,M,N)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ U12 ] (X0,X1,X2) = 1*X2 + 2*X1 + 2; 
 [ Marked_plus ] (X0,X1) = 2*X1; 
 [ s ] (X0) = 1*X0 + 2; 
 [ activate ] (X0) = 1*X0; 
 [ Marked_U12 ] (X0,X1,X2) = 2*X1; 
 [ 0 ] () = 3; 
 [ tt ] () = 0; 
 [ Marked_U11 ] (X0,X1,X2) = 2*X1 + 3; 
 [ plus ] (X0,X1) = 2*X1 + 1*X0; 
 [ U11 ] (X0,X1,X2) = 1*X2 + 2*X1 + 2; 
 removing <Marked_U11(tt,M,N),Marked_U12(tt,activate(M),activate(N))><
Marked_plus(N,s(M)),Marked_U11(tt,M,N)>
 [ {
      
     DP termination of:
     <Marked_U12(tt,M,N) , Marked_plus(activate(N),activate(M))>
 ,
 CRITERION: SG
 [  ]} 
 ]} 
 ]} 
 ]} 

Cime worked for 0.046246 seconds (real time)
Cime Exit Status: 0