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

TRS termination of:
[1] +(x,0) -> x
[2] +(x,s(y)) -> s(+(x,y))
[3]  *(x,0) -> 0
[4]  *(x,s(y)) -> +( *(x,y),x)
[5] ge(x,0) -> true
[6] ge(0,s(y)) -> false
[7] ge(s(x),s(y)) -> ge(x,y)
[8] -(x,0) -> x
[9] -(s(x),s(y)) -> -(x,y)
[10] fact(x) -> iffact(x,ge(x,s(s(0))))
[11] iffact(x,true) ->  *(x,fact(-(x,s(0))))
[12] iffact(x,false) -> s(0)


Sub problem: 
guided: 

DP termination of:
<Marked_+(x,s(y)) , Marked_+(x,y)>
<Marked_*(x,s(y)) , Marked_+( *(x,y),x)>
<Marked_*(x,s(y)) , Marked_*(x,y)>
<Marked_ge(s(x),s(y)) , Marked_ge(x,y)>
<Marked_-(s(x),s(y)) , Marked_-(x,y)>
<Marked_fact(x) , Marked_iffact(x,ge(x,s(s(0))))>
<Marked_fact(x) , Marked_ge(x,s(s(0)))>
<Marked_iffact(x,true) , Marked_*(x,fact(-(x,s(0))))>
<Marked_iffact(x,true) , Marked_fact(-(x,s(0)))>
<Marked_iffact(x,true) , Marked_-(x,s(0))>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 5 components:

{  <Marked_iffact(x,true) , Marked_fact(-(x,s(0)))> 
      --> <Marked_fact(x) , Marked_iffact(x,ge(x,s(s(0))))>
  <Marked_fact(x) , Marked_iffact(x,ge(x,s(s(0))))> 
     --> <Marked_iffact(x,true) , Marked_fact(-(x,s(0)))>
}

{  <Marked_*(x,s(y)) , Marked_*(x,y)> --> <Marked_*(x,s(y)) , Marked_*(x,y)>
}

{  <Marked_+(x,s(y)) , Marked_+(x,y)> --> <Marked_+(x,s(y)) , Marked_+(x,y)>
}

{  <Marked_ge(s(x),s(y)) , Marked_ge(x,y)> 
      --> <Marked_ge(s(x),s(y)) , Marked_ge(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:
{
  +(x,0) >= x ;
  +(x,s(y)) >= s(+(x,y)) ;
   *(x,0) >= 0 ;
   *(x,s(y)) >= +( *(x,y),x) ;
  ge(0,s(y)) >= false ;
  ge(s(x),s(y)) >= ge(x,y) ;
  ge(x,0) >= true ;
  -(s(x),s(y)) >= -(x,y) ;
  -(x,0) >= x ;
  iffact(x,true) >=  *(x,fact(-(x,s(0)))) ;
  iffact(x,false) >= s(0) ;
  fact(x) >= iffact(x,ge(x,s(s(0)))) ;
  Marked_iffact(x,true) >= Marked_fact(-(x,s(0))) ;
  Marked_fact(x) >= Marked_iffact(x,ge(x,s(s(0)))) ;
 }
 + Disjunctions:{ 
{
  Marked_iffact(x,true) > Marked_fact(-(x,s(0))) ;
 }
{
  Marked_fact(x) > Marked_iffact(x,ge(x,s(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 11.242579 seconds (real time)
Cime Exit Status: 0