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

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


Sub problem: 
guided: 

DP termination of:
<Marked_leq(s(x),s(y)) , Marked_leq(x,y)>
<Marked_-(s(x),s(y)) , Marked_-(x,y)>
<Marked_mod(s(x),s(y)) , Marked_if(leq(y,x),mod(-(s(x),s(y)),s(y)),s(x))>
<Marked_mod(s(x),s(y)) , Marked_leq(y,x)>
<Marked_mod(s(x),s(y)) , Marked_mod(-(s(x),s(y)),s(y))>
<Marked_mod(s(x),s(y)) , Marked_-(s(x),s(y))>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

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

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

{  <Marked_-(s(x),s(y)) , Marked_-(x,y)> 
      --> <Marked_-(s(x),s(y)) , Marked_-(x,y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  leq(0,y) >= true ;
  leq(s(x),0) >= false ;
  leq(s(x),s(y)) >= leq(x,y) ;
  if(true,x,y) >= x ;
  if(false,x,y) >= y ;
  -(s(x),s(y)) >= -(x,y) ;
  -(x,0) >= x ;
  mod(0,y) >= 0 ;
  mod(s(x),0) >= 0 ;
  mod(s(x),s(y)) >= if(leq(y,x),mod(-(s(x),s(y)),s(y)),s(x)) ;
  Marked_mod(s(x),s(y)) >= Marked_mod(-(s(x),s(y)),s(y)) ;
 }
 + Disjunctions:{ 
{
  Marked_mod(s(x),s(y)) > Marked_mod(-(s(x),s(y)),s(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 : 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.000184 seconds (real time)
Cime Exit Status: 0