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

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


Sub problem: 
guided: 

DP termination of:
<Marked_2nd(cons(X,n__cons(Y,Z))) , Marked_activate(Y)>
<Marked_from(X) , Marked_cons(X,n__from(n__s(X)))>
<Marked_activate(n__cons(X1,X2)) , Marked_cons(activate(X1),X2)>
<Marked_activate(n__cons(X1,X2)) , 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__s(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__cons(X1,X2)) , Marked_activate(X1)>
  <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)>
  <Marked_activate(n__from(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__cons(X1,X2)) , Marked_activate(X1)>
  <Marked_activate(n__cons(X1,X2)) , Marked_activate(X1)> 
     --> <Marked_activate(n__s(X)) , Marked_activate(X)>
  <Marked_activate(n__cons(X1,X2)) , Marked_activate(X1)> 
     --> <Marked_activate(n__from(X)) , Marked_activate(X)>
  <Marked_activate(n__cons(X1,X2)) , Marked_activate(X1)> 
     --> <Marked_activate(n__cons(X1,X2)) , Marked_activate(X1)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  activate(n__cons(X1,X2)) >= cons(activate(X1),X2) ;
  activate(n__from(X)) >= from(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(X) >= X ;
  2nd(cons(X,n__cons(Y,Z))) >= activate(Y) ;
  cons(X1,X2) >= n__cons(X1,X2) ;
  from(X) >= cons(X,n__from(n__s(X))) ;
  from(X) >= n__from(X) ;
  s(X) >= n__s(X) ;
  Marked_activate(n__cons(X1,X2)) >= Marked_activate(X1) ;
  Marked_activate(n__from(X)) >= Marked_activate(X) ;
  Marked_activate(n__s(X)) >= Marked_activate(X) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__cons(X1,X2)) > Marked_activate(X1) ;
 }
{
  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 ===
=== STOPING TIMER virtual ===
constraint: activate(n__cons(X1,X2)) >= cons(activate(X1),X2)
constraint: activate(n__from(X)) >= from(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(X) >= X
constraint: 2nd(cons(X,n__cons(Y,Z))) >= activate(Y)
constraint: cons(X1,X2) >= n__cons(X1,X2)
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__cons(X1,X2)) >= Marked_activate(X1)
constraint: Marked_activate(n__from(X)) >= Marked_activate(X)
constraint: Marked_activate(n__s(X)) >= Marked_activate(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] 2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
[2] from(X) -> cons(X,n__from(n__s(X)))
[3] cons(X1,X2) -> n__cons(X1,X2)
[4] from(X) -> n__from(X)
[5] s(X) -> n__s(X)
[6] activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
[7] activate(n__from(X)) -> from(activate(X))
[8] activate(n__s(X)) -> s(activate(X))
[9] activate(X) -> X
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_2nd(cons(X,n__cons(Y,Z))) , Marked_activate(Y)>
<Marked_from(X) , Marked_cons(X,n__from(n__s(X)))>
<Marked_activate(n__cons(X1,X2)) , Marked_cons(activate(X1),X2)>
<Marked_activate(n__cons(X1,X2)) , 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__cons(X1,X2)) , Marked_activate(X1)>
<Marked_activate(n__from(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_activate(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     RPO with AFS = AFS: 
     and precedence:
     prec (All symbols are Lex.): { activate  <  2nd ; activate  >  cons ;
                                   activate  >  n__cons ;
                                   activate  >  n__from ; activate  >  n__s ;
                                   activate  >  from ; activate  >  s ;
                                   2nd  >  activate ; 2nd  >  cons ;
                                   2nd  >  n__cons ; 2nd  >  n__from ;
                                   2nd  >  n__s ; 2nd  >  from ; 2nd  >  s ;
                                   cons  <  activate ; cons  <  2nd ;
                                   cons  >  n__cons ; cons  <  from ;
                                   n__cons  <  activate ; n__cons  <  2nd ;
                                   n__cons  <  cons ; n__cons  <  from ;
                                   n__from  <  activate ; n__from  <  2nd ;
                                   n__from  <  from ; n__s  <  activate ;
                                   n__s  <  2nd ; n__s  <  from ; n__s  <  s ;
                                   from  <  activate ; from  <  2nd ;
                                   from  >  cons ; from  >  n__cons ;
                                   from  >  n__from ; from  >  n__s ;
                                   s  <  activate ; s  <  2nd ; s  >  n__s ; }

 ]} 
 ]} 
 ]} 

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