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

TRS termination of:
[1] first(0,X) -> nil
[2] first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
[3] from(X) -> cons(X,n__from(s(X)))
[4] first(X1,X2) -> n__first(X1,X2)
[5] from(X) -> n__from(X)
[6] activate(n__first(X1,X2)) -> first(X1,X2)
[7] activate(n__from(X)) -> from(X)
[8] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)>
<Marked_activate(n__first(X1,X2)) , Marked_first(X1,X2)>
<Marked_activate(n__from(X)) , Marked_from(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__first(X1,X2)) , Marked_first(X1,X2)> 
      --> <Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)>
  <Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_first(X1,X2)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  first(0,X) >= nil ;
  first(s(X),cons(Y,Z)) >= cons(Y,n__first(X,activate(Z))) ;
  first(X1,X2) >= n__first(X1,X2) ;
  activate(n__first(X1,X2)) >= first(X1,X2) ;
  activate(n__from(X)) >= from(X) ;
  activate(X) >= X ;
  from(X) >= cons(X,n__from(s(X))) ;
  from(X) >= n__from(X) ;
  Marked_activate(n__first(X1,X2)) >= Marked_first(X1,X2) ;
  Marked_first(s(X),cons(Y,Z)) >= Marked_activate(Z) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__first(X1,X2)) > Marked_first(X1,X2) ;
 }
{
  Marked_first(s(X),cons(Y,Z)) > Marked_activate(Z) ;
 }
 } 
=== 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: first(0,X) >= nil
constraint: first(s(X),cons(Y,Z)) >= cons(Y,n__first(X,activate(Z)))
constraint: first(X1,X2) >= n__first(X1,X2)
constraint: activate(n__first(X1,X2)) >= first(X1,X2)
constraint: activate(n__from(X)) >= from(X)
constraint: activate(X) >= X
constraint: from(X) >= cons(X,n__from(s(X)))
constraint: from(X) >= n__from(X)
constraint: Marked_activate(n__first(X1,X2)) >= Marked_first(X1,X2)
constraint: Marked_first(s(X),cons(Y,Z)) >= Marked_activate(Z)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] first(0,X) -> nil
[2] first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
[3] from(X) -> cons(X,n__from(s(X)))
[4] first(X1,X2) -> n__first(X1,X2)
[5] from(X) -> n__from(X)
[6] activate(n__first(X1,X2)) -> first(X1,X2)
[7] activate(n__from(X)) -> from(X)
[8] activate(X) -> X
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)>
<Marked_activate(n__first(X1,X2)) , Marked_first(X1,X2)>
<Marked_activate(n__from(X)) , Marked_from(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)>
<Marked_activate(n__first(X1,X2)) , Marked_first(X1,X2)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ nil ] () = 2 + 0; 
 [ from ] (X0) = 2 + 0; 
 [ n__first ] (X0,X1) = 1*X1 + 0; 
 [ 0 ] () = 3 + 0; 
 [ s ] (X0) = 0; 
 [ first ] (X0,X1) = 2 + 2*X1 + 0; 
 [ Marked_activate ] (X0) = 2 + 2*X0 + 0; 
 [ activate ] (X0) = 2 + 2*X0 + 0; 
 [ cons ] (X0,X1) = 2 + 2*X1 + 0; 
 [ Marked_first ] (X0,X1) = 2*X1 + 0; 
 [ n__from ] (X0) = 0; 
 ]} 
 ]} 
 ]} 

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