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

TRS termination of:
[1] log(x,s(s(y))) -> cond(le(x,s(s(y))),x,y)
[2] cond(true,x,y) -> s(0)
[3] cond(false,x,y) -> double(log(x,square(s(s(y)))))
[4] le(0,v) -> true
[5] le(s(u),0) -> false
[6] le(s(u),s(v)) -> le(u,v)
[7] double(0) -> 0
[8] double(s(x)) -> s(s(double(x)))
[9] square(0) -> 0
[10] square(s(x)) -> s(plus(square(x),double(x)))
[11] plus(n,0) -> n
[12] plus(n,s(m)) -> s(plus(n,m))


Sub problem: 
guided: 

DP termination of:
<Marked_log(x,s(s(y))) , Marked_cond(le(x,s(s(y))),x,y)>
<Marked_log(x,s(s(y))) , Marked_le(x,s(s(y)))>
<Marked_cond(false,x,y) , Marked_double(log(x,square(s(s(y)))))>
<Marked_cond(false,x,y) , Marked_log(x,square(s(s(y))))>
<Marked_cond(false,x,y) , Marked_square(s(s(y)))>
<Marked_le(s(u),s(v)) , Marked_le(u,v)>
<Marked_double(s(x)) , Marked_double(x)>
<Marked_square(s(x)) , Marked_plus(square(x),double(x))>
<Marked_square(s(x)) , Marked_square(x)>
<Marked_square(s(x)) , Marked_double(x)>
<Marked_plus(n,s(m)) , Marked_plus(n,m)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 5 components:

{  <Marked_cond(false,x,y) , Marked_log(x,square(s(s(y))))> 
      --> <Marked_log(x,s(s(y))) , Marked_cond(le(x,s(s(y))),x,y)>
  <Marked_log(x,s(s(y))) , Marked_cond(le(x,s(s(y))),x,y)> 
     --> <Marked_cond(false,x,y) , Marked_log(x,square(s(s(y))))>
}

{  <Marked_le(s(u),s(v)) , Marked_le(u,v)> 
      --> <Marked_le(s(u),s(v)) , Marked_le(u,v)>
}

{  <Marked_square(s(x)) , Marked_square(x)> 
      --> <Marked_square(s(x)) , Marked_square(x)>
}

{  <Marked_double(s(x)) , Marked_double(x)> 
      --> <Marked_double(s(x)) , Marked_double(x)>
}

{  <Marked_plus(n,s(m)) , Marked_plus(n,m)> 
      --> <Marked_plus(n,s(m)) , Marked_plus(n,m)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cond(true,x,y) >= s(0) ;
  cond(false,x,y) >= double(log(x,square(s(s(y))))) ;
  le(s(u),s(v)) >= le(u,v) ;
  le(s(u),0) >= false ;
  le(0,v) >= true ;
  log(x,s(s(y))) >= cond(le(x,s(s(y))),x,y) ;
  double(s(x)) >= s(s(double(x))) ;
  double(0) >= 0 ;
  square(s(x)) >= s(plus(square(x),double(x))) ;
  square(0) >= 0 ;
  plus(n,s(m)) >= s(plus(n,m)) ;
  plus(n,0) >= n ;
  Marked_cond(false,x,y) >= Marked_log(x,square(s(s(y)))) ;
  Marked_log(x,s(s(y))) >= Marked_cond(le(x,s(s(y))),x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_cond(false,x,y) > Marked_log(x,square(s(s(y)))) ;
 }
{
  Marked_log(x,s(s(y))) > Marked_cond(le(x,s(s(y))),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 ===
=== 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
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
No solution found for these constraints.
APPLY CRITERIA (ID_CRIT)
NOT SOLVED
No proof found
Cime worked for 35.781591 seconds (real time)
Cime Exit Status: 0