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

TRS termination of:
[1] div(x,s(y)) -> d(x,s(y),0)
[2] d(x,s(y),z) -> cond(ge(x,z),x,y,z)
[3] cond(true,x,y,z) -> s(d(x,s(y),plus(s(y),z)))
[4] cond(false,x,y,z) -> 0
[5] ge(u,0) -> true
[6] ge(0,s(v)) -> false
[7] ge(s(u),s(v)) -> ge(u,v)
[8] plus(n,0) -> n
[9] plus(n,s(m)) -> s(plus(n,m))


Sub problem: 
guided: 

DP termination of:
<Marked_div(x,s(y)) , Marked_d(x,s(y),0)>
<Marked_d(x,s(y),z) , Marked_cond(ge(x,z),x,y,z)>
<Marked_d(x,s(y),z) , Marked_ge(x,z)>
<Marked_cond(true,x,y,z) , Marked_d(x,s(y),plus(s(y),z))>
<Marked_cond(true,x,y,z) , Marked_plus(s(y),z)>
<Marked_ge(s(u),s(v)) , Marked_ge(u,v)>
<Marked_plus(n,s(m)) , Marked_plus(n,m)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_cond(true,x,y,z) , Marked_d(x,s(y),plus(s(y),z))> 
      --> <Marked_d(x,s(y),z) , Marked_cond(ge(x,z),x,y,z)>
  <Marked_d(x,s(y),z) , Marked_cond(ge(x,z),x,y,z)> 
     --> <Marked_cond(true,x,y,z) , Marked_d(x,s(y),plus(s(y),z))>
}

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

{  <Marked_plus(n,s(m)) , Marked_plus(n,m)> 
      --> <Marked_plus(n,s(m)) , Marked_plus(n,m)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  d(x,s(y),z) >= cond(ge(x,z),x,y,z) ;
  div(x,s(y)) >= d(x,s(y),0) ;
  cond(true,x,y,z) >= s(d(x,s(y),plus(s(y),z))) ;
  cond(false,x,y,z) >= 0 ;
  ge(s(u),s(v)) >= ge(u,v) ;
  ge(0,s(v)) >= false ;
  ge(u,0) >= true ;
  plus(n,s(m)) >= s(plus(n,m)) ;
  plus(n,0) >= n ;
  Marked_cond(true,x,y,z) >= Marked_d(x,s(y),plus(s(y),z)) ;
  Marked_d(x,s(y),z) >= Marked_cond(ge(x,z),x,y,z) ;
 }
 + Disjunctions:{ 
{
  Marked_cond(true,x,y,z) > Marked_d(x,s(y),plus(s(y),z)) ;
 }
{
  Marked_d(x,s(y),z) > Marked_cond(ge(x,z),x,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 (Simple graph)
Found the following constraints:
{
  d(x,s(y),z) >= cond(ge(x,z),x,y,z) ;
  div(x,s(y)) >= d(x,s(y),0) ;
  cond(true,x,y,z) >= s(d(x,s(y),plus(s(y),z))) ;
  cond(false,x,y,z) >= 0 ;
  ge(s(u),s(v)) >= ge(u,v) ;
  ge(0,s(v)) >= false ;
  ge(u,0) >= true ;
  plus(n,s(m)) >= s(plus(n,m)) ;
  plus(n,0) >= n ;
  Marked_cond(true,x,y,z) >= Marked_d(x,s(y),plus(s(y),z)) ;
  Marked_d(x,s(y),z) > Marked_cond(ge(x,z),x,y,z) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  d(x,s(y),z) >= cond(ge(x,z),x,y,z) ;
  div(x,s(y)) >= d(x,s(y),0) ;
  cond(true,x,y,z) >= s(d(x,s(y),plus(s(y),z))) ;
  cond(false,x,y,z) >= 0 ;
  ge(s(u),s(v)) >= ge(u,v) ;
  ge(0,s(v)) >= false ;
  ge(u,0) >= true ;
  plus(n,s(m)) >= s(plus(n,m)) ;
  plus(n,0) >= n ;
  Marked_cond(true,x,y,z) >= Marked_d(x,s(y),plus(s(y),z)) ;
  Marked_d(x,s(y),z) > Marked_cond(ge(x,z),x,y,z) ;
 }
 + 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.(19201 bt (19020) [1734])
=== 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 3.531084 seconds (real time)
Cime Exit Status: 0