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

TRS termination of:
[1] p(0) -> s(s(0))
[2] p(s(x)) -> x
[3] p(p(s(x))) -> p(x)
[4] le(p(s(x)),x) -> le(x,x)
[5] le(0,y) -> true
[6] le(s(x),0) -> false
[7] le(s(x),s(y)) -> le(x,y)
[8] minus(x,y) -> if(le(x,y),x,y)
[9] if(true,x,y) -> 0
[10] if(false,x,y) -> s(minus(p(x),y))


Sub problem: 
guided: 

DP termination of:
<Marked_p(p(s(x))) , Marked_p(x)>
<Marked_le(p(s(x)),x) , Marked_le(x,x)>
<Marked_le(s(x),s(y)) , Marked_le(x,y)>
<Marked_minus(x,y) , Marked_if(le(x,y),x,y)>
<Marked_minus(x,y) , Marked_le(x,y)>
<Marked_if(false,x,y) , Marked_minus(p(x),y)>
<Marked_if(false,x,y) , Marked_p(x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_if(false,x,y) , Marked_minus(p(x),y)> 
      --> <Marked_minus(x,y) , Marked_if(le(x,y),x,y)>
  <Marked_minus(x,y) , Marked_if(le(x,y),x,y)> 
     --> <Marked_if(false,x,y) , Marked_minus(p(x),y)>
}

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

{  <Marked_p(p(s(x))) , Marked_p(x)> --> <Marked_p(p(s(x))) , Marked_p(x)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  p(s(x)) >= x ;
  p(0) >= s(s(0)) ;
  p(p(s(x))) >= p(x) ;
  le(s(x),s(y)) >= le(x,y) ;
  le(s(x),0) >= false ;
  le(0,y) >= true ;
  le(p(s(x)),x) >= le(x,x) ;
  if(true,x,y) >= 0 ;
  if(false,x,y) >= s(minus(p(x),y)) ;
  minus(x,y) >= if(le(x,y),x,y) ;
  Marked_if(false,x,y) >= Marked_minus(p(x),y) ;
  Marked_minus(x,y) >= Marked_if(le(x,y),x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_if(false,x,y) > Marked_minus(p(x),y) ;
 }
{
  Marked_minus(x,y) > Marked_if(le(x,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 0.516750 seconds (real time)
Cime Exit Status: 0