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

TRS termination of:
[1] 2nd(cons1(X,cons(Y,Z))) -> Y
[2] 2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
[3] from(X) -> cons(X,n__from(n__s(X)))
[4] from(X) -> n__from(X)
[5] s(X) -> n__s(X)
[6] activate(n__from(X)) -> from(activate(X))
[7] activate(n__s(X)) -> s(activate(X))
[8] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_2nd(cons(X,X1)) , Marked_2nd(cons1(X,activate(X1)))>
<Marked_2nd(cons(X,X1)) , Marked_activate(X1)>
<Marked_activate(n__from(X)) , Marked_from(activate(X))>
<Marked_activate(n__from(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_s(activate(X))>
<Marked_activate(n__s(X)) , Marked_activate(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__s(X)) , Marked_activate(X)> 
      --> <Marked_activate(n__s(X)) , Marked_activate(X)>
  <Marked_activate(n__s(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__from(X)) , Marked_activate(X)>
  <Marked_activate(n__from(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__s(X)) , Marked_activate(X)>
  <Marked_activate(n__from(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__from(X)) , Marked_activate(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  2nd(cons1(X,cons(Y,Z))) >= Y ;
  2nd(cons(X,X1)) >= 2nd(cons1(X,activate(X1))) ;
  activate(n__from(X)) >= from(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(X) >= X ;
  from(X) >= cons(X,n__from(n__s(X))) ;
  from(X) >= n__from(X) ;
  s(X) >= n__s(X) ;
  Marked_activate(n__from(X)) >= Marked_activate(X) ;
  Marked_activate(n__s(X)) >= Marked_activate(X) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__from(X)) > Marked_activate(X) ;
 }
{
  Marked_activate(n__s(X)) > Marked_activate(X) ;
 }
 } 
=== 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
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
Entering rpo_solver
=== TIMER virtual : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
=== TIMER virtual : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
=== TIMER virtual : 15.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 15.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
=== TIMER virtual : 50.000000 ===
trying sub matrices of size: 1
Matrix interpretation constraints generated.
Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. 
Termination constraints generated.
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 50.000000 ===
=== STOPING TIMER real ===
Sat solver returned
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: 2nd(cons1(X,cons(Y,Z))) >= Y
constraint: 2nd(cons(X,X1)) >= 2nd(cons1(X,activate(X1)))
constraint: activate(n__from(X)) >= from(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(X) >= X
constraint: from(X) >= cons(X,n__from(n__s(X)))
constraint: from(X) >= n__from(X)
constraint: s(X) >= n__s(X)
constraint: Marked_activate(n__from(X)) >= Marked_activate(X)
constraint: Marked_activate(n__s(X)) >= Marked_activate(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__s(X)) , Marked_activate(X)> 
      --> <Marked_activate(n__s(X)) , Marked_activate(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  2nd(cons1(X,cons(Y,Z))) >= Y ;
  2nd(cons(X,X1)) >= 2nd(cons1(X,activate(X1))) ;
  activate(n__from(X)) >= from(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(X) >= X ;
  from(X) >= cons(X,n__from(n__s(X))) ;
  from(X) >= n__from(X) ;
  s(X) >= n__s(X) ;
  Marked_activate(n__s(X)) >= Marked_activate(X) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__s(X)) > Marked_activate(X) ;
 }
 } 
=== 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
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
Entering rpo_solver
=== TIMER virtual : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
=== TIMER virtual : 15.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 15.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
=== TIMER virtual : 50.000000 ===
trying sub matrices of size: 1
Matrix interpretation constraints generated.
Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. 
Termination constraints generated.
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 50.000000 ===
=== STOPING TIMER real ===
Sat solver returned
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: 2nd(cons1(X,cons(Y,Z))) >= Y
constraint: 2nd(cons(X,X1)) >= 2nd(cons1(X,activate(X1)))
constraint: activate(n__from(X)) >= from(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(X) >= X
constraint: from(X) >= cons(X,n__from(n__s(X)))
constraint: from(X) >= n__from(X)
constraint: s(X) >= n__s(X)
constraint: Marked_activate(n__s(X)) >= Marked_activate(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] 2nd(cons1(X,cons(Y,Z))) -> Y
[2] 2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
[3] from(X) -> cons(X,n__from(n__s(X)))
[4] from(X) -> n__from(X)
[5] s(X) -> n__s(X)
[6] activate(n__from(X)) -> from(activate(X))
[7] activate(n__s(X)) -> s(activate(X))
[8] activate(X) -> X
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_2nd(cons(X,X1)) , Marked_2nd(cons1(X,activate(X1)))>
<Marked_2nd(cons(X,X1)) , Marked_activate(X1)>
<Marked_activate(n__from(X)) , Marked_from(activate(X))>
<Marked_activate(n__from(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_s(activate(X))>
<Marked_activate(n__s(X)) , Marked_activate(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_activate(n__from(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_activate(X)>
 ,
 CRITERION: CG using Matrix polynomial interpretation (strict sub matrices size: 1x1) = 
 [ 2nd ] (X0) = [ [ 1 , 0 , 1 ] [ 1 , 0 , 1 ] [ 0 , 1 , 1 ] ]*X0 + [ [ 1 , 1 , 1 ] [ 1 , 1 , 1 ] [ 1 , 1 , 1 ] ]; 
 [ Marked_activate ] (X0) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ n__from ] (X0) = [ [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] [ 0 , 0 , 1 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; 
 [ cons ] (X0,X1) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] ]*X1 + 
[ [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ from ] (X0) = [ [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; 
 [ cons1 ] (X0,X1) = [ [ 0 , 1 , 0 ] [ 0 , 1 , 0 ] [ 0 , 0 , 0 ] ]*X1 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ n__s ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ activate ] (X0) = [ [ 1 , 0 , 0 ] [ 0 , 1 , 0 ] [ 0 , 0 , 1 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ s ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 removing <Marked_activate(n__from(X)),Marked_activate(X)>
 [ {
      
     DP termination of:
     <Marked_activate(n__s(X)) , Marked_activate(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_activate(n__s(X)) , Marked_activate(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     Matrix polynomial interpretation (strict sub matrices size: 1x1) = 
      [ 2nd ] (X0) = [ [ 1 , 1 , 0 ] [ 1 , 1 , 0 ] [ 1 , 1 , 0 ] ]*X0 + 
     [ [ 1 , 1 , 1 ] [ 1 , 1 , 1 ] [ 1 , 1 , 1 ] ]; 
 [ Marked_activate ] (X0) = [ [ 0 , 1 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ n__from ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 1 , 0 ] [ 0 , 1 , 1 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ cons ] (X0,X1) = [ [ 1 , 0 , 0 ] [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] ]*X1 + 
[ [ 1 , 1 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ from ] (X0) = [ [ 1 , 1 , 1 ] [ 0 , 1 , 0 ] [ 0 , 1 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ cons1 ] (X0,X1) = [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ n__s ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ activate ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 1 , 0 ] [ 0 , 0 , 1 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ s ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 

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