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

TRS termination of:
[1] terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
[2] sqr(0) -> 0
[3] sqr(s(X)) -> s(add(sqr(X),dbl(X)))
[4] dbl(0) -> 0
[5] dbl(s(X)) -> s(s(dbl(X)))
[6] add(0,X) -> X
[7] add(s(X),Y) -> s(add(X,Y))
[8] first(0,X) -> nil
[9] first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
[10] half(0) -> 0
[11] half(s(0)) -> 0
[12] half(s(s(X))) -> s(half(X))
[13] half(dbl(X)) -> X
[14] terms(X) -> n__terms(X)
[15] s(X) -> n__s(X)
[16] first(X1,X2) -> n__first(X1,X2)
[17] activate(n__terms(X)) -> terms(activate(X))
[18] activate(n__s(X)) -> s(activate(X))
[19] activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
[20] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_terms(N) , Marked_sqr(N)>
<Marked_sqr(s(X)) , Marked_s(add(sqr(X),dbl(X)))>
<Marked_sqr(s(X)) , Marked_add(sqr(X),dbl(X))>
<Marked_sqr(s(X)) , Marked_sqr(X)>
<Marked_sqr(s(X)) , Marked_dbl(X)>
<Marked_dbl(s(X)) , Marked_s(s(dbl(X)))>
<Marked_dbl(s(X)) , Marked_s(dbl(X))>
<Marked_dbl(s(X)) , Marked_dbl(X)>
<Marked_add(s(X),Y) , Marked_s(add(X,Y))>
<Marked_add(s(X),Y) , Marked_add(X,Y)>
<Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)>
<Marked_half(s(s(X))) , Marked_s(half(X))>
<Marked_half(s(s(X))) , Marked_half(X)>
<Marked_activate(n__terms(X)) , Marked_terms(activate(X))>
<Marked_activate(n__terms(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_s(activate(X))>
<Marked_activate(n__s(X)) , Marked_activate(X)>
<Marked_activate(n__first(X1,X2)) , Marked_first(activate(X1),activate(X2))>
<Marked_activate(n__first(X1,X2)) , Marked_activate(X1)>
<Marked_activate(n__first(X1,X2)) , Marked_activate(X2)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 5 components:

{  <Marked_half(s(s(X))) , Marked_half(X)> 
      --> <Marked_half(s(s(X))) , Marked_half(X)>
}

{  <Marked_activate(n__first(X1,X2)) , Marked_activate(X2)> 
      --> <Marked_activate(n__first(X1,X2)) , Marked_activate(X2)>
  <Marked_activate(n__first(X1,X2)) , Marked_activate(X2)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_activate(X1)>
  <Marked_activate(n__first(X1,X2)) , Marked_activate(X2)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_first(activate(X1),
                                              activate(X2))>
  <Marked_activate(n__first(X1,X2)) , Marked_activate(X2)> 
     --> <Marked_activate(n__s(X)) , Marked_activate(X)>
  <Marked_activate(n__first(X1,X2)) , Marked_activate(X2)> 
     --> <Marked_activate(n__terms(X)) , Marked_activate(X)>
  <Marked_activate(n__first(X1,X2)) , Marked_activate(X1)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_activate(X2)>
  <Marked_activate(n__first(X1,X2)) , Marked_activate(X1)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_activate(X1)>
  <Marked_activate(n__first(X1,X2)) , Marked_activate(X1)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_first(activate(X1),
                                              activate(X2))>
  <Marked_activate(n__first(X1,X2)) , Marked_activate(X1)> 
     --> <Marked_activate(n__s(X)) , Marked_activate(X)>
  <Marked_activate(n__first(X1,X2)) , Marked_activate(X1)> 
     --> <Marked_activate(n__terms(X)) , Marked_activate(X)>
  <Marked_activate(n__first(X1,X2)) , Marked_first(activate(X1),activate(X2))> 
     --> <Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)>
  <Marked_activate(n__s(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_activate(X2)>
  <Marked_activate(n__s(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_activate(X1)>
  <Marked_activate(n__s(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_first(activate(X1),
                                              activate(X2))>
  <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__terms(X)) , Marked_activate(X)>
  <Marked_activate(n__terms(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_activate(X2)>
  <Marked_activate(n__terms(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_activate(X1)>
  <Marked_activate(n__terms(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_first(activate(X1),
                                              activate(X2))>
  <Marked_activate(n__terms(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__s(X)) , Marked_activate(X)>
  <Marked_activate(n__terms(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__terms(X)) , Marked_activate(X)>
  <Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_activate(X2)>
  <Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_activate(X1)>
  <Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)> 
     --> <Marked_activate(n__first(X1,X2)) , Marked_first(activate(X1),
                                              activate(X2))>
  <Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)> 
     --> <Marked_activate(n__s(X)) , Marked_activate(X)>
  <Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)> 
     --> <Marked_activate(n__terms(X)) , Marked_activate(X)>
}

{  <Marked_sqr(s(X)) , Marked_sqr(X)> --> <Marked_sqr(s(X)) , Marked_sqr(X)>
}

{  <Marked_add(s(X),Y) , Marked_add(X,Y)> 
      --> <Marked_add(s(X),Y) , Marked_add(X,Y)>
}

{  <Marked_dbl(s(X)) , Marked_dbl(X)> --> <Marked_dbl(s(X)) , Marked_dbl(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  sqr(0) >= 0 ;
  sqr(s(X)) >= s(add(sqr(X),dbl(X))) ;
  terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N))) ;
  terms(X) >= n__terms(X) ;
  s(X) >= n__s(X) ;
  add(0,X) >= X ;
  add(s(X),Y) >= s(add(X,Y)) ;
  dbl(0) >= 0 ;
  dbl(s(X)) >= s(s(dbl(X))) ;
  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__terms(X)) >= terms(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(n__first(X1,X2)) >= first(activate(X1),activate(X2)) ;
  activate(X) >= X ;
  half(0) >= 0 ;
  half(s(0)) >= 0 ;
  half(s(s(X))) >= s(half(X)) ;
  half(dbl(X)) >= X ;
  Marked_half(s(s(X))) >= Marked_half(X) ;
 }
 + Disjunctions:{ 
{
  Marked_half(s(s(X))) > Marked_half(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: sqr(0) >= 0
constraint: sqr(s(X)) >= s(add(sqr(X),dbl(X)))
constraint: terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N)))
constraint: terms(X) >= n__terms(X)
constraint: s(X) >= n__s(X)
constraint: add(0,X) >= X
constraint: add(s(X),Y) >= s(add(X,Y))
constraint: dbl(0) >= 0
constraint: dbl(s(X)) >= s(s(dbl(X)))
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__terms(X)) >= terms(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(n__first(X1,X2)) >= first(activate(X1),activate(X2))
constraint: activate(X) >= X
constraint: half(0) >= 0
constraint: half(s(0)) >= 0
constraint: half(s(s(X))) >= s(half(X))
constraint: half(dbl(X)) >= X
constraint: Marked_half(s(s(X))) >= Marked_half(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  sqr(0) >= 0 ;
  sqr(s(X)) >= s(add(sqr(X),dbl(X))) ;
  terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N))) ;
  terms(X) >= n__terms(X) ;
  s(X) >= n__s(X) ;
  add(0,X) >= X ;
  add(s(X),Y) >= s(add(X,Y)) ;
  dbl(0) >= 0 ;
  dbl(s(X)) >= s(s(dbl(X))) ;
  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__terms(X)) >= terms(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(n__first(X1,X2)) >= first(activate(X1),activate(X2)) ;
  activate(X) >= X ;
  half(0) >= 0 ;
  half(s(0)) >= 0 ;
  half(s(s(X))) >= s(half(X)) ;
  half(dbl(X)) >= X ;
  Marked_activate(n__terms(X)) >= Marked_activate(X) ;
  Marked_activate(n__s(X)) >= Marked_activate(X) ;
  Marked_activate(n__first(X1,X2)) >= Marked_activate(X1) ;
  Marked_activate(n__first(X1,X2)) >= Marked_activate(X2) ;
  Marked_activate(n__first(X1,X2)) >= Marked_first(activate(X1),activate(X2)) ;
  Marked_first(s(X),cons(Y,Z)) >= Marked_activate(Z) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__terms(X)) > Marked_activate(X) ;
 }
{
  Marked_activate(n__s(X)) > Marked_activate(X) ;
 }
{
  Marked_activate(n__first(X1,X2)) > Marked_activate(X1) ;
 }
{
  Marked_activate(n__first(X1,X2)) > Marked_activate(X2) ;
 }
{
  Marked_activate(n__first(X1,X2)) > Marked_first(activate(X1),activate(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: sqr(0) >= 0
constraint: sqr(s(X)) >= s(add(sqr(X),dbl(X)))
constraint: terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N)))
constraint: terms(X) >= n__terms(X)
constraint: s(X) >= n__s(X)
constraint: add(0,X) >= X
constraint: add(s(X),Y) >= s(add(X,Y))
constraint: dbl(0) >= 0
constraint: dbl(s(X)) >= s(s(dbl(X)))
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__terms(X)) >= terms(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(n__first(X1,X2)) >= first(activate(X1),activate(X2))
constraint: activate(X) >= X
constraint: half(0) >= 0
constraint: half(s(0)) >= 0
constraint: half(s(s(X))) >= s(half(X))
constraint: half(dbl(X)) >= X
constraint: Marked_activate(n__terms(X)) >= Marked_activate(X)
constraint: Marked_activate(n__s(X)) >= Marked_activate(X)
constraint: Marked_activate(n__first(X1,X2)) >= Marked_activate(X1)
constraint: Marked_activate(n__first(X1,X2)) >= Marked_activate(X2)
constraint: Marked_activate(n__first(X1,X2)) >= Marked_first(activate(X1),
                                                 activate(X2))
constraint: Marked_first(s(X),cons(Y,Z)) >= Marked_activate(Z)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  sqr(0) >= 0 ;
  sqr(s(X)) >= s(add(sqr(X),dbl(X))) ;
  terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N))) ;
  terms(X) >= n__terms(X) ;
  s(X) >= n__s(X) ;
  add(0,X) >= X ;
  add(s(X),Y) >= s(add(X,Y)) ;
  dbl(0) >= 0 ;
  dbl(s(X)) >= s(s(dbl(X))) ;
  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__terms(X)) >= terms(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(n__first(X1,X2)) >= first(activate(X1),activate(X2)) ;
  activate(X) >= X ;
  half(0) >= 0 ;
  half(s(0)) >= 0 ;
  half(s(s(X))) >= s(half(X)) ;
  half(dbl(X)) >= X ;
  Marked_sqr(s(X)) >= Marked_sqr(X) ;
 }
 + Disjunctions:{ 
{
  Marked_sqr(s(X)) > Marked_sqr(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: sqr(0) >= 0
constraint: sqr(s(X)) >= s(add(sqr(X),dbl(X)))
constraint: terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N)))
constraint: terms(X) >= n__terms(X)
constraint: s(X) >= n__s(X)
constraint: add(0,X) >= X
constraint: add(s(X),Y) >= s(add(X,Y))
constraint: dbl(0) >= 0
constraint: dbl(s(X)) >= s(s(dbl(X)))
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__terms(X)) >= terms(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(n__first(X1,X2)) >= first(activate(X1),activate(X2))
constraint: activate(X) >= X
constraint: half(0) >= 0
constraint: half(s(0)) >= 0
constraint: half(s(s(X))) >= s(half(X))
constraint: half(dbl(X)) >= X
constraint: Marked_sqr(s(X)) >= Marked_sqr(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  sqr(0) >= 0 ;
  sqr(s(X)) >= s(add(sqr(X),dbl(X))) ;
  terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N))) ;
  terms(X) >= n__terms(X) ;
  s(X) >= n__s(X) ;
  add(0,X) >= X ;
  add(s(X),Y) >= s(add(X,Y)) ;
  dbl(0) >= 0 ;
  dbl(s(X)) >= s(s(dbl(X))) ;
  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__terms(X)) >= terms(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(n__first(X1,X2)) >= first(activate(X1),activate(X2)) ;
  activate(X) >= X ;
  half(0) >= 0 ;
  half(s(0)) >= 0 ;
  half(s(s(X))) >= s(half(X)) ;
  half(dbl(X)) >= X ;
  Marked_add(s(X),Y) >= Marked_add(X,Y) ;
 }
 + Disjunctions:{ 
{
  Marked_add(s(X),Y) > Marked_add(X,Y) ;
 }
 } 
=== 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: sqr(0) >= 0
constraint: sqr(s(X)) >= s(add(sqr(X),dbl(X)))
constraint: terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N)))
constraint: terms(X) >= n__terms(X)
constraint: s(X) >= n__s(X)
constraint: add(0,X) >= X
constraint: add(s(X),Y) >= s(add(X,Y))
constraint: dbl(0) >= 0
constraint: dbl(s(X)) >= s(s(dbl(X)))
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__terms(X)) >= terms(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(n__first(X1,X2)) >= first(activate(X1),activate(X2))
constraint: activate(X) >= X
constraint: half(0) >= 0
constraint: half(s(0)) >= 0
constraint: half(s(s(X))) >= s(half(X))
constraint: half(dbl(X)) >= X
constraint: Marked_add(s(X),Y) >= Marked_add(X,Y)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  sqr(0) >= 0 ;
  sqr(s(X)) >= s(add(sqr(X),dbl(X))) ;
  terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N))) ;
  terms(X) >= n__terms(X) ;
  s(X) >= n__s(X) ;
  add(0,X) >= X ;
  add(s(X),Y) >= s(add(X,Y)) ;
  dbl(0) >= 0 ;
  dbl(s(X)) >= s(s(dbl(X))) ;
  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__terms(X)) >= terms(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(n__first(X1,X2)) >= first(activate(X1),activate(X2)) ;
  activate(X) >= X ;
  half(0) >= 0 ;
  half(s(0)) >= 0 ;
  half(s(s(X))) >= s(half(X)) ;
  half(dbl(X)) >= X ;
  Marked_dbl(s(X)) >= Marked_dbl(X) ;
 }
 + Disjunctions:{ 
{
  Marked_dbl(s(X)) > Marked_dbl(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: sqr(0) >= 0
constraint: sqr(s(X)) >= s(add(sqr(X),dbl(X)))
constraint: terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N)))
constraint: terms(X) >= n__terms(X)
constraint: s(X) >= n__s(X)
constraint: add(0,X) >= X
constraint: add(s(X),Y) >= s(add(X,Y))
constraint: dbl(0) >= 0
constraint: dbl(s(X)) >= s(s(dbl(X)))
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__terms(X)) >= terms(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(n__first(X1,X2)) >= first(activate(X1),activate(X2))
constraint: activate(X) >= X
constraint: half(0) >= 0
constraint: half(s(0)) >= 0
constraint: half(s(s(X))) >= s(half(X))
constraint: half(dbl(X)) >= X
constraint: Marked_dbl(s(X)) >= Marked_dbl(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
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__terms(X)) , Marked_activate(X)>
  <Marked_activate(n__terms(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__s(X)) , Marked_activate(X)>
  <Marked_activate(n__terms(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__terms(X)) , Marked_activate(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  sqr(0) >= 0 ;
  sqr(s(X)) >= s(add(sqr(X),dbl(X))) ;
  terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N))) ;
  terms(X) >= n__terms(X) ;
  s(X) >= n__s(X) ;
  add(0,X) >= X ;
  add(s(X),Y) >= s(add(X,Y)) ;
  dbl(0) >= 0 ;
  dbl(s(X)) >= s(s(dbl(X))) ;
  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__terms(X)) >= terms(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(n__first(X1,X2)) >= first(activate(X1),activate(X2)) ;
  activate(X) >= X ;
  half(0) >= 0 ;
  half(s(0)) >= 0 ;
  half(s(s(X))) >= s(half(X)) ;
  half(dbl(X)) >= X ;
  Marked_activate(n__terms(X)) >= Marked_activate(X) ;
  Marked_activate(n__s(X)) >= Marked_activate(X) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__terms(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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: sqr(0) >= 0
constraint: sqr(s(X)) >= s(add(sqr(X),dbl(X)))
constraint: terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N)))
constraint: terms(X) >= n__terms(X)
constraint: s(X) >= n__s(X)
constraint: add(0,X) >= X
constraint: add(s(X),Y) >= s(add(X,Y))
constraint: dbl(0) >= 0
constraint: dbl(s(X)) >= s(s(dbl(X)))
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__terms(X)) >= terms(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(n__first(X1,X2)) >= first(activate(X1),activate(X2))
constraint: activate(X) >= X
constraint: half(0) >= 0
constraint: half(s(0)) >= 0
constraint: half(s(s(X))) >= s(half(X))
constraint: half(dbl(X)) >= X
constraint: Marked_activate(n__terms(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:
{
  sqr(0) >= 0 ;
  sqr(s(X)) >= s(add(sqr(X),dbl(X))) ;
  terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N))) ;
  terms(X) >= n__terms(X) ;
  s(X) >= n__s(X) ;
  add(0,X) >= X ;
  add(s(X),Y) >= s(add(X,Y)) ;
  dbl(0) >= 0 ;
  dbl(s(X)) >= s(s(dbl(X))) ;
  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__terms(X)) >= terms(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(n__first(X1,X2)) >= first(activate(X1),activate(X2)) ;
  activate(X) >= X ;
  half(0) >= 0 ;
  half(s(0)) >= 0 ;
  half(s(s(X))) >= s(half(X)) ;
  half(dbl(X)) >= 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 ===
=== STOPING TIMER virtual ===
constraint: sqr(0) >= 0
constraint: sqr(s(X)) >= s(add(sqr(X),dbl(X)))
constraint: terms(N) >= cons(recip(sqr(N)),n__terms(n__s(N)))
constraint: terms(X) >= n__terms(X)
constraint: s(X) >= n__s(X)
constraint: add(0,X) >= X
constraint: add(s(X),Y) >= s(add(X,Y))
constraint: dbl(0) >= 0
constraint: dbl(s(X)) >= s(s(dbl(X)))
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__terms(X)) >= terms(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(n__first(X1,X2)) >= first(activate(X1),activate(X2))
constraint: activate(X) >= X
constraint: half(0) >= 0
constraint: half(s(0)) >= 0
constraint: half(s(s(X))) >= s(half(X))
constraint: half(dbl(X)) >= X
constraint: Marked_activate(n__s(X)) >= Marked_activate(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
[2] sqr(0) -> 0
[3] sqr(s(X)) -> s(add(sqr(X),dbl(X)))
[4] dbl(0) -> 0
[5] dbl(s(X)) -> s(s(dbl(X)))
[6] add(0,X) -> X
[7] add(s(X),Y) -> s(add(X,Y))
[8] first(0,X) -> nil
[9] first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
[10] half(0) -> 0
[11] half(s(0)) -> 0
[12] half(s(s(X))) -> s(half(X))
[13] half(dbl(X)) -> X
[14] terms(X) -> n__terms(X)
[15] s(X) -> n__s(X)
[16] first(X1,X2) -> n__first(X1,X2)
[17] activate(n__terms(X)) -> terms(activate(X))
[18] activate(n__s(X)) -> s(activate(X))
[19] activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
[20] activate(X) -> X
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_terms(N) , Marked_sqr(N)>
<Marked_sqr(s(X)) , Marked_s(add(sqr(X),dbl(X)))>
<Marked_sqr(s(X)) , Marked_add(sqr(X),dbl(X))>
<Marked_sqr(s(X)) , Marked_sqr(X)>
<Marked_sqr(s(X)) , Marked_dbl(X)>
<Marked_dbl(s(X)) , Marked_s(s(dbl(X)))>
<Marked_dbl(s(X)) , Marked_s(dbl(X))>
<Marked_dbl(s(X)) , Marked_dbl(X)>
<Marked_add(s(X),Y) , Marked_s(add(X,Y))>
<Marked_add(s(X),Y) , Marked_add(X,Y)>
<Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)>
<Marked_half(s(s(X))) , Marked_s(half(X))>
<Marked_half(s(s(X))) , Marked_half(X)>
<Marked_activate(n__terms(X)) , Marked_terms(activate(X))>
<Marked_activate(n__terms(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_s(activate(X))>
<Marked_activate(n__s(X)) , Marked_activate(X)>
<Marked_activate(n__first(X1,X2)) , Marked_first(activate(X1),activate(X2))>
<Marked_activate(n__first(X1,X2)) , Marked_activate(X1)>
<Marked_activate(n__first(X1,X2)) , Marked_activate(X2)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_half(s(s(X))) , Marked_half(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     RPO with AFS = AFS: cons -> 1n__first -> 0first -> 0
     and precedence:
     prec (All symbols are Lex.): { sqr  >  n__s ; sqr  >  s ; sqr  >  add ;
                                   sqr  >  dbl ; n__terms  <  terms ;
                                   n__terms  <  activate ; n__s  <  sqr ;
                                   n__s  <  terms ; n__s  <  s ; n__s  <  add ;
                                   n__s  <  dbl ; n__s  <  activate ;
                                   n__s  <  half ; terms  >  n__terms ;
                                   terms  >  n__s ; terms  <  activate ;
                                   0  >  nil ; s  <  sqr ; s  >  n__s ;
                                   s  <  add ; s  <  dbl ; s  <  activate ;
                                   s  <  half ; add  <  sqr ; add  >  n__s ;
                                   add  >  s ; dbl  <  sqr ; dbl  >  n__s ;
                                   dbl  >  s ; nil  <  0 ;
                                   activate  >  n__terms ; activate  >  n__s ;
                                   activate  >  terms ; activate  >  s ;
                                   half  >  n__s ; half  >  s ; }

 ]} 
{
 
DP termination of:
<Marked_first(s(X),cons(Y,Z)) , Marked_activate(Z)>
<Marked_activate(n__terms(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_activate(X)>
<Marked_activate(n__first(X1,X2)) , Marked_first(activate(X1),activate(X2))>
<Marked_activate(n__first(X1,X2)) , Marked_activate(X1)>
<Marked_activate(n__first(X1,X2)) , Marked_activate(X2)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ cons ] (X0,X1) = 1*X1; 
 [ Marked_first ] (X0,X1) = 2*X1 + 2; 
 [ add ] (X0,X1) = 2*X1; 
 [ n__s ] (X0) = 1*X0; 
 [ n__first ] (X0,X1) = 1*X1 + 1*X0 + 1; 
 [ sqr ] (X0) = 2*X0; 
 [ nil ] () = 1; 
 [ 0 ] () = 0; 
 [ half ] (X0) = 2*X0; 
 [ recip ] (X0) = 0; 
 [ dbl ] (X0) = 1*X0; 
 [ terms ] (X0) = 2*X0; 
 [ activate ] (X0) = 1*X0; 
 [ n__terms ] (X0) = 2*X0; 
 [ first ] (X0,X1) = 1*X1 + 1*X0 + 1; 
 [ s ] (X0) = 1*X0; 
 [ Marked_activate ] (X0) = 2*X0; 
 removing <Marked_first(s(X),cons(Y,Z)),Marked_activate(Z)><Marked_activate(
                                                             n__first(
                                                              X1,X2)),
Marked_activate(X1)><Marked_activate(n__first(X1,X2)),Marked_activate(X2)>
 [ {
      
     DP termination of:
     <Marked_activate(n__terms(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_activate(X)>
<Marked_activate(n__first(X1,X2)) , Marked_first(activate(X1),activate(X2))>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_activate(n__terms(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_activate(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ cons ] (X0,X1) = 0; 
 [ add ] (X0,X1) = 1*X1; 
 [ n__s ] (X0) = 1*X0; 
 [ n__first ] (X0,X1) = 2; 
 [ sqr ] (X0) = 1*X0; 
 [ nil ] () = 2; 
 [ 0 ] () = 0; 
 [ half ] (X0) = 1*X0; 
 [ recip ] (X0) = 0; 
 [ dbl ] (X0) = 1*X0; 
 [ terms ] (X0) = 1*X0 + 1; 
 [ activate ] (X0) = 2*X0; 
 [ n__terms ] (X0) = 1*X0 + 1; 
 [ first ] (X0,X1) = 2; 
 [ s ] (X0) = 1*X0; 
 [ Marked_activate ] (X0) = 3*X0; 
 removing <Marked_activate(n__terms(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:
     RPO with AFS = AFS: cons -> 1n__first -> 0first -> 0
     and precedence:
     prec (All symbols are Lex.): { sqr  >  n__s ; sqr  >  s ; sqr  >  add ;
                                   sqr  >  dbl ; n__terms  <  terms ;
                                   n__terms  <  activate ; n__s  <  sqr ;
                                   n__s  <  terms ; n__s  <  s ; n__s  <  add ;
                                   n__s  <  dbl ; n__s  <  activate ;
                                   n__s  <  half ; terms  >  n__terms ;
                                   terms  >  n__s ; terms  <  activate ;
                                   0  >  nil ; s  <  sqr ; s  >  n__s ;
                                   s  <  add ; s  <  dbl ; s  <  activate ;
                                   s  <  half ; add  <  sqr ; add  >  n__s ;
                                   add  >  s ; dbl  <  sqr ; dbl  >  n__s ;
                                   dbl  >  s ; nil  <  0 ;
                                   activate  >  n__terms ; activate  >  n__s ;
                                   activate  >  terms ; activate  >  s ;
                                   half  >  n__s ; half  >  s ; }

 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_sqr(s(X)) , Marked_sqr(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     RPO with AFS = AFS: cons -> 1n__first -> 0first -> 0
     and precedence:
     prec (All symbols are Lex.): { sqr  >  n__s ; sqr  >  s ; sqr  >  add ;
                                   sqr  >  dbl ; n__terms  <  terms ;
                                   n__terms  <  activate ; n__s  <  sqr ;
                                   n__s  <  terms ; n__s  <  s ; n__s  <  add ;
                                   n__s  <  dbl ; n__s  <  activate ;
                                   n__s  <  half ; terms  >  n__terms ;
                                   terms  >  n__s ; terms  <  activate ;
                                   0  >  nil ; s  <  sqr ; s  >  n__s ;
                                   s  <  add ; s  <  dbl ; s  <  activate ;
                                   s  <  half ; add  <  sqr ; add  >  n__s ;
                                   add  >  s ; dbl  <  sqr ; dbl  >  n__s ;
                                   dbl  >  s ; nil  <  0 ;
                                   activate  >  n__terms ; activate  >  n__s ;
                                   activate  >  terms ; activate  >  s ;
                                   half  >  n__s ; half  >  s ; }

 ]} 
{
 
DP termination of:
<Marked_add(s(X),Y) , Marked_add(X,Y)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     RPO with AFS = AFS: cons -> 1n__first -> 0first -> 0
     and precedence:
     prec (All symbols are Lex.): { sqr  >  n__s ; sqr  >  s ; sqr  >  add ;
                                   sqr  >  dbl ; n__terms  <  terms ;
                                   n__terms  <  activate ; n__s  <  sqr ;
                                   n__s  <  terms ; n__s  <  s ; n__s  <  add ;
                                   n__s  <  dbl ; n__s  <  activate ;
                                   n__s  <  half ; terms  >  n__terms ;
                                   terms  >  n__s ; terms  <  activate ;
                                   0  >  nil ; s  <  sqr ; s  >  n__s ;
                                   s  <  add ; s  <  dbl ; s  <  activate ;
                                   s  <  half ; add  <  sqr ; add  >  n__s ;
                                   add  >  s ; dbl  <  sqr ; dbl  >  n__s ;
                                   dbl  >  s ; nil  <  0 ;
                                   activate  >  n__terms ; activate  >  n__s ;
                                   activate  >  terms ; activate  >  s ;
                                   half  >  n__s ; half  >  s ; }

 ]} 
{
 
DP termination of:
<Marked_dbl(s(X)) , Marked_dbl(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     RPO with AFS = AFS: cons -> 1n__first -> 0first -> 0
     and precedence:
     prec (All symbols are Lex.): { sqr  >  n__s ; sqr  >  s ; sqr  >  add ;
                                   sqr  >  dbl ; n__terms  <  terms ;
                                   n__terms  <  activate ; n__s  <  sqr ;
                                   n__s  <  terms ; n__s  <  s ; n__s  <  add ;
                                   n__s  <  dbl ; n__s  <  activate ;
                                   n__s  <  half ; terms  >  n__terms ;
                                   terms  >  n__s ; terms  <  activate ;
                                   0  >  nil ; s  <  sqr ; s  >  n__s ;
                                   s  <  add ; s  <  dbl ; s  <  activate ;
                                   s  <  half ; add  <  sqr ; add  >  n__s ;
                                   add  >  s ; dbl  <  sqr ; dbl  >  n__s ;
                                   dbl  >  s ; nil  <  0 ;
                                   activate  >  n__terms ; activate  >  n__s ;
                                   activate  >  terms ; activate  >  s ;
                                   half  >  n__s ; half  >  s ; }

 ]} 
 ]} 
 ]} 

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