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

TRS termination of:
[1] minus(0,y) -> 0
[2] minus(x,0) -> x
[3] minus(s(x),s(y)) -> minus(x,y)
[4] plus(0,y) -> y
[5] plus(s(x),y) -> plus(x,s(y))
[6] zero(s(x)) -> false
[7] zero(0) -> true
[8] p(s(x)) -> x
[9] div(x,y) -> quot(x,y,0)
[10] quot(x,y,z) -> if(zero(x),x,y,plus(z,s(0)))
[11] if(true,x,y,z) -> p(z)
[12] if(false,x,s(y),z) -> quot(minus(x,s(y)),s(y),z)


Sub problem: 
guided: 

DP termination of:
<Marked_minus(s(x),s(y)) , Marked_minus(x,y)>
<Marked_plus(s(x),y) , Marked_plus(x,s(y))>
<Marked_div(x,y) , Marked_quot(x,y,0)>
<Marked_quot(x,y,z) , Marked_if(zero(x),x,y,plus(z,s(0)))>
<Marked_quot(x,y,z) , Marked_zero(x)>
<Marked_quot(x,y,z) , Marked_plus(z,s(0))>
<Marked_if(true,x,y,z) , Marked_p(z)>
<Marked_if(false,x,s(y),z) , Marked_quot(minus(x,s(y)),s(y),z)>
<Marked_if(false,x,s(y),z) , Marked_minus(x,s(y))>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_if(false,x,s(y),z) , Marked_quot(minus(x,s(y)),s(y),z)> 
      --> <Marked_quot(x,y,z) , Marked_if(zero(x),x,y,plus(z,s(0)))>
  <Marked_quot(x,y,z) , Marked_if(zero(x),x,y,plus(z,s(0)))> 
     --> <Marked_if(false,x,s(y),z) , Marked_quot(minus(x,s(y)),s(y),z)>
}

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

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