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

TRS termination of:
[1] le(s(x),0) -> false
[2] le(0,y) -> true
[3] le(s(x),s(y)) -> le(x,y)
[4] plus(0,y) -> y
[5] plus(s(x),y) -> s(plus(x,y))
[6] times(0,y) -> 0
[7] times(s(x),y) -> plus(y,times(x,y))
[8] log(x,0) -> baseError
[9] log(x,s(0)) -> baseError
[10] log(0,s(s(b))) -> logZeroError
[11] log(s(x),s(s(b))) -> loop(s(x),s(s(b)),s(0),0)
[12] loop(x,s(s(b)),s(y),z) -> if(le(x,s(y)),x,s(s(b)),s(y),z)
[13] if(true,x,b,y,z) -> z
[14] if(false,x,b,y,z) -> loop(x,b,times(b,y),s(z))


Sub problem: 
guided: 

DP termination of:
<Marked_le(s(x),s(y)) , Marked_le(x,y)>
<Marked_plus(s(x),y) , Marked_plus(x,y)>
<Marked_times(s(x),y) , Marked_plus(y,times(x,y))>
<Marked_times(s(x),y) , Marked_times(x,y)>
<Marked_log(s(x),s(s(b))) , Marked_loop(s(x),s(s(b)),s(0),0)>
<Marked_loop(x,s(s(b)),s(y),z) , Marked_if(le(x,s(y)),x,s(s(b)),s(y),z)>
<Marked_loop(x,s(s(b)),s(y),z) , Marked_le(x,s(y))>
<Marked_if(false,x,b,y,z) , Marked_loop(x,b,times(b,y),s(z))>
<Marked_if(false,x,b,y,z) , Marked_times(b,y)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 4 components:

{  <Marked_if(false,x,b,y,z) , Marked_loop(x,b,times(b,y),s(z))> 
      --> <Marked_loop(x,s(s(b)),s(y),z) , Marked_if(le(x,s(y)),x,s(s(b)),
                                            s(y),z)>
  <Marked_loop(x,s(s(b)),s(y),z) , Marked_if(le(x,s(y)),x,s(s(b)),s(y),z)> 
     --> <Marked_if(false,x,b,y,z) , Marked_loop(x,b,times(b,y),s(z))>
}

{  <Marked_le(s(x),s(y)) , Marked_le(x,y)> 
      --> <Marked_le(s(x),s(y)) , Marked_le(x,y)>
}

{  <Marked_times(s(x),y) , Marked_times(x,y)> 
      --> <Marked_times(s(x),y) , Marked_times(x,y)>
}

{  <Marked_plus(s(x),y) , Marked_plus(x,y)> 
      --> <Marked_plus(s(x),y) , Marked_plus(x,y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  le(s(x),s(y)) >= le(x,y) ;
  le(s(x),0) >= false ;
  le(0,y) >= true ;
  plus(s(x),y) >= s(plus(x,y)) ;
  plus(0,y) >= y ;
  times(s(x),y) >= plus(y,times(x,y)) ;
  times(0,y) >= 0 ;
  log(s(x),s(s(b))) >= loop(s(x),s(s(b)),s(0),0) ;
  log(0,s(s(b))) >= logZeroError ;
  log(x,s(0)) >= baseError ;
  log(x,0) >= baseError ;
  loop(x,s(s(b)),s(y),z) >= if(le(x,s(y)),x,s(s(b)),s(y),z) ;
  if(false,x,b,y,z) >= loop(x,b,times(b,y),s(z)) ;
  if(true,x,b,y,z) >= z ;
  Marked_if(false,x,b,y,z) >= Marked_loop(x,b,times(b,y),s(z)) ;
  Marked_loop(x,s(s(b)),s(y),z) >= Marked_if(le(x,s(y)),x,s(s(b)),s(y),z) ;
 }
 + Disjunctions:{ 
{
  Marked_if(false,x,b,y,z) > Marked_loop(x,b,times(b,y),s(z)) ;
 }
{
  Marked_loop(x,s(s(b)),s(y),z) > Marked_if(le(x,s(y)),x,s(s(b)),s(y),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
=== 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 10.552711 seconds (real time)
Cime Exit Status: 0