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

TRS termination of:
[1] le(0,y,z) -> greater(y,z)
[2] le(s(x),0,z) -> false
[3] le(s(x),s(y),0) -> false
[4] le(s(x),s(y),s(z)) -> le(x,y,z)
[5] greater(x,0) -> first
[6] greater(0,s(y)) -> second
[7] greater(s(x),s(y)) -> greater(x,y)
[8] double(0) -> 0
[9] double(s(x)) -> s(s(double(x)))
[10] triple(x) -> if(le(x,x,double(x)),x,0,0)
[11] if(false,x,y,z) -> true
[12] if(first,x,y,z) -> if(le(s(x),y,s(z)),s(x),y,s(z))
[13] if(second,x,y,z) -> if(le(s(x),s(y),z),s(x),s(y),z)


Sub problem: 
guided: 

DP termination of:
<Marked_le(0,y,z) , Marked_greater(y,z)>
<Marked_le(s(x),s(y),s(z)) , Marked_le(x,y,z)>
<Marked_greater(s(x),s(y)) , Marked_greater(x,y)>
<Marked_double(s(x)) , Marked_double(x)>
<Marked_triple(x) , Marked_if(le(x,x,double(x)),x,0,0)>
<Marked_triple(x) , Marked_le(x,x,double(x))>
<Marked_triple(x) , Marked_double(x)>
<Marked_if(first,x,y,z) , Marked_if(le(s(x),y,s(z)),s(x),y,s(z))>
<Marked_if(first,x,y,z) , Marked_le(s(x),y,s(z))>
<Marked_if(second,x,y,z) , Marked_if(le(s(x),s(y),z),s(x),s(y),z)>
<Marked_if(second,x,y,z) , Marked_le(s(x),s(y),z)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 4 components:

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

{  <Marked_if(second,x,y,z) , Marked_if(le(s(x),s(y),z),s(x),s(y),z)> 
      --> <Marked_if(second,x,y,z) , Marked_if(le(s(x),s(y),z),s(x),s(y),z)>
  <Marked_if(second,x,y,z) , Marked_if(le(s(x),s(y),z),s(x),s(y),z)> 
     --> <Marked_if(first,x,y,z) , Marked_if(le(s(x),y,s(z)),s(x),y,s(z))>
  <Marked_if(first,x,y,z) , Marked_if(le(s(x),y,s(z)),s(x),y,s(z))> 
     --> <Marked_if(second,x,y,z) , Marked_if(le(s(x),s(y),z),s(x),s(y),z)>
  <Marked_if(first,x,y,z) , Marked_if(le(s(x),y,s(z)),s(x),y,s(z))> 
     --> <Marked_if(first,x,y,z) , Marked_if(le(s(x),y,s(z)),s(x),y,s(z))>
}

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

{  <Marked_greater(s(x),s(y)) , Marked_greater(x,y)> 
      --> <Marked_greater(s(x),s(y)) , Marked_greater(x,y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  greater(0,s(y)) >= second ;
  greater(s(x),s(y)) >= greater(x,y) ;
  greater(x,0) >= first ;
  le(0,y,z) >= greater(y,z) ;
  le(s(x),0,z) >= false ;
  le(s(x),s(y),0) >= false ;
  le(s(x),s(y),s(z)) >= le(x,y,z) ;
  double(0) >= 0 ;
  double(s(x)) >= s(s(double(x))) ;
  if(false,x,y,z) >= true ;
  if(first,x,y,z) >= if(le(s(x),y,s(z)),s(x),y,s(z)) ;
  if(second,x,y,z) >= if(le(s(x),s(y),z),s(x),s(y),z) ;
  triple(x) >= if(le(x,x,double(x)),x,0,0) ;
  Marked_double(s(x)) >= Marked_double(x) ;
 }
 + Disjunctions:{ 
{
  Marked_double(s(x)) > Marked_double(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: greater(0,s(y)) >= second
constraint: greater(s(x),s(y)) >= greater(x,y)
constraint: greater(x,0) >= first
constraint: le(0,y,z) >= greater(y,z)
constraint: le(s(x),0,z) >= false
constraint: le(s(x),s(y),0) >= false
constraint: le(s(x),s(y),s(z)) >= le(x,y,z)
constraint: double(0) >= 0
constraint: double(s(x)) >= s(s(double(x)))
constraint: if(false,x,y,z) >= true
constraint: if(first,x,y,z) >= if(le(s(x),y,s(z)),s(x),y,s(z))
constraint: if(second,x,y,z) >= if(le(s(x),s(y),z),s(x),s(y),z)
constraint: triple(x) >= if(le(x,x,double(x)),x,0,0)
constraint: Marked_double(s(x)) >= Marked_double(x)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  greater(0,s(y)) >= second ;
  greater(s(x),s(y)) >= greater(x,y) ;
  greater(x,0) >= first ;
  le(0,y,z) >= greater(y,z) ;
  le(s(x),0,z) >= false ;
  le(s(x),s(y),0) >= false ;
  le(s(x),s(y),s(z)) >= le(x,y,z) ;
  double(0) >= 0 ;
  double(s(x)) >= s(s(double(x))) ;
  if(false,x,y,z) >= true ;
  if(first,x,y,z) >= if(le(s(x),y,s(z)),s(x),y,s(z)) ;
  if(second,x,y,z) >= if(le(s(x),s(y),z),s(x),s(y),z) ;
  triple(x) >= if(le(x,x,double(x)),x,0,0) ;
  Marked_if(first,x,y,z) >= Marked_if(le(s(x),y,s(z)),s(x),y,s(z)) ;
  Marked_if(second,x,y,z) >= Marked_if(le(s(x),s(y),z),s(x),s(y),z) ;
 }
 + Disjunctions:{ 
{
  Marked_if(first,x,y,z) > Marked_if(le(s(x),y,s(z)),s(x),y,s(z)) ;
 }
{
  Marked_if(second,x,y,z) > Marked_if(le(s(x),s(y),z),s(x),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 7.268435 seconds (real time)
Cime Exit Status: 0