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

TRS termination of:
[1] p(s(x)) -> x
[2] fact(0) -> s(0)
[3] fact(s(x)) ->  *(s(x),fact(p(s(x))))
[4]  *(0,y) -> 0
[5]  *(s(x),y) -> +( *(x,y),y)
[6] +(x,0) -> x
[7] +(x,s(y)) -> s(+(x,y))


Sub problem: 
guided: 

DP termination of:
<Marked_fact(s(x)) , Marked_*(s(x),fact(p(s(x))))>
<Marked_fact(s(x)) , Marked_fact(p(s(x)))>
<Marked_fact(s(x)) , Marked_p(s(x))>
<Marked_*(s(x),y) , Marked_+( *(x,y),y)>
<Marked_*(s(x),y) , Marked_*(x,y)>
<Marked_+(x,s(y)) , Marked_+(x,y)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_fact(s(x)) , Marked_fact(p(s(x)))> 
      --> <Marked_fact(s(x)) , Marked_fact(p(s(x)))>
}

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

{  <Marked_+(x,s(y)) , Marked_+(x,y)> --> <Marked_+(x,s(y)) , Marked_+(x,y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  p(s(x)) >= x ;
  fact(s(x)) >=  *(s(x),fact(p(s(x)))) ;
  fact(0) >= s(0) ;
   *(s(x),y) >= +( *(x,y),y) ;
   *(0,y) >= 0 ;
  +(x,s(y)) >= s(+(x,y)) ;
  +(x,0) >= x ;
  Marked_fact(s(x)) >= Marked_fact(p(s(x))) ;
 }
 + Disjunctions:{ 
{
  Marked_fact(s(x)) > Marked_fact(p(s(x))) ;
 }
 } 
=== 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 0.565552 seconds (real time)
Cime Exit Status: 0