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

TRS termination of:
[1] minus(x,y) -> cond(equal(min(x,y),y),x,y)
[2] cond(true,x,y) -> s(minus(x,s(y)))
[3] min(0,v) -> 0
[4] min(u,0) -> 0
[5] min(s(u),s(v)) -> s(min(u,v))
[6] equal(0,0) -> true
[7] equal(s(x),0) -> false
[8] equal(0,s(y)) -> false
[9] equal(s(x),s(y)) -> equal(x,y)


Sub problem: 
guided: 

DP termination of:
<Marked_minus(x,y) , Marked_cond(equal(min(x,y),y),x,y)>
<Marked_minus(x,y) , Marked_equal(min(x,y),y)>
<Marked_minus(x,y) , Marked_min(x,y)>
<Marked_cond(true,x,y) , Marked_minus(x,s(y))>
<Marked_min(s(u),s(v)) , Marked_min(u,v)>
<Marked_equal(s(x),s(y)) , Marked_equal(x,y)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_cond(true,x,y) , Marked_minus(x,s(y))> 
      --> <Marked_minus(x,y) , Marked_cond(equal(min(x,y),y),x,y)>
  <Marked_minus(x,y) , Marked_cond(equal(min(x,y),y),x,y)> 
     --> <Marked_cond(true,x,y) , Marked_minus(x,s(y))>
}

{  <Marked_min(s(u),s(v)) , Marked_min(u,v)> 
      --> <Marked_min(s(u),s(v)) , Marked_min(u,v)>
}

{  <Marked_equal(s(x),s(y)) , Marked_equal(x,y)> 
      --> <Marked_equal(s(x),s(y)) , Marked_equal(x,y)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cond(true,x,y) >= s(minus(x,s(y))) ;
  equal(s(x),s(y)) >= equal(x,y) ;
  equal(s(x),0) >= false ;
  equal(0,s(y)) >= false ;
  equal(0,0) >= true ;
  min(s(u),s(v)) >= s(min(u,v)) ;
  min(0,v) >= 0 ;
  min(u,0) >= 0 ;
  minus(x,y) >= cond(equal(min(x,y),y),x,y) ;
  Marked_cond(true,x,y) >= Marked_minus(x,s(y)) ;
  Marked_minus(x,y) >= Marked_cond(equal(min(x,y),y),x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_cond(true,x,y) > Marked_minus(x,s(y)) ;
 }
{
  Marked_minus(x,y) > Marked_cond(equal(min(x,y),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 (Simple graph)
Found the following constraints:
{
  cond(true,x,y) >= s(minus(x,s(y))) ;
  equal(s(x),s(y)) >= equal(x,y) ;
  equal(s(x),0) >= false ;
  equal(0,s(y)) >= false ;
  equal(0,0) >= true ;
  min(s(u),s(v)) >= s(min(u,v)) ;
  min(0,v) >= 0 ;
  min(u,0) >= 0 ;
  minus(x,y) >= cond(equal(min(x,y),y),x,y) ;
  Marked_cond(true,x,y) >= Marked_minus(x,s(y)) ;
  Marked_minus(x,y) > Marked_cond(equal(min(x,y),y),x,y) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  cond(true,x,y) >= s(minus(x,s(y))) ;
  equal(s(x),s(y)) >= equal(x,y) ;
  equal(s(x),0) >= false ;
  equal(0,s(y)) >= false ;
  equal(0,0) >= true ;
  min(s(u),s(v)) >= s(min(u,v)) ;
  min(0,v) >= 0 ;
  min(u,0) >= 0 ;
  minus(x,y) >= cond(equal(min(x,y),y),x,y) ;
  Marked_cond(true,x,y) >= Marked_minus(x,s(y)) ;
  Marked_minus(x,y) > Marked_cond(equal(min(x,y),y),x,y) ;
 }
 + Disjunctions:{ 
 } 
=== 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 ===
No solution found for these parameters.(4766 bt (4733) [558])
=== 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 1.833931 seconds (real time)
Cime Exit Status: 0