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

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


Sub problem: 
guided: 

DP termination of:
<Marked_+(s(x),y) , Marked_+(x,y)>
<Marked_*(x,s(y)) , Marked_+(x, *(x,y))>
<Marked_*(x,s(y)) , Marked_*(x,y)>
<Marked_twice(s(x)) , Marked_twice(x)>
<Marked_-(s(x),s(y)) , Marked_-(x,y)>
<Marked_f(s(x)) , Marked_f(-( *(s(s(x)),s(s(x))),+( *(s(x),s(s(x))),s(s(0)))))>
<Marked_f(s(x)) , Marked_-( *(s(s(x)),s(s(x))),+( *(s(x),s(s(x))),s(s(0))))>
<Marked_f(s(x)) , Marked_*(s(s(x)),s(s(x)))>
<Marked_f(s(x)) , Marked_+( *(s(x),s(s(x))),s(s(0)))>
<Marked_f(s(x)) , Marked_*(s(x),s(s(x)))>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 5 components:

{  <Marked_twice(s(x)) , Marked_twice(x)> 
      --> <Marked_twice(s(x)) , Marked_twice(x)>
}

{  <Marked_f(s(x)) , Marked_f(-( *(s(s(x)),s(s(x))),
                               +( *(s(x),s(s(x))),s(s(0)))))> 
      --> <Marked_f(s(x)) , Marked_f(-( *(s(s(x)),s(s(x))),
                                      +( *(s(x),s(s(x))),s(s(0)))))>
}

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

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

{  <Marked_+(s(x),y) , Marked_+(x,y)> --> <Marked_+(s(x),y) , Marked_+(x,y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  +(0,y) >= y ;
  +(s(x),y) >= s(+(x,y)) ;
   *(x,0) >= 0 ;
   *(x,s(y)) >= +(x, *(x,y)) ;
  twice(0) >= 0 ;
  twice(s(x)) >= s(s(twice(x))) ;
  -(s(x),s(y)) >= -(x,y) ;
  -(x,0) >= x ;
  f(s(x)) >= f(-( *(s(s(x)),s(s(x))),+( *(s(x),s(s(x))),s(s(0))))) ;
  Marked_twice(s(x)) >= Marked_twice(x) ;
 }
 + Disjunctions:{ 
{
  Marked_twice(s(x)) > Marked_twice(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 ===
=== STOPING TIMER virtual ===
constraint: +(0,y) >= y
constraint: +(s(x),y) >= s(+(x,y))
constraint:  *(x,0) >= 0
constraint:  *(x,s(y)) >= +(x, *(x,y))
constraint: twice(0) >= 0
constraint: twice(s(x)) >= s(s(twice(x)))
constraint: -(s(x),s(y)) >= -(x,y)
constraint: -(x,0) >= x
constraint: f(s(x)) >= f(-( *(s(s(x)),s(s(x))),+( *(s(x),s(s(x))),s(s(0)))))
constraint: Marked_twice(s(x)) >= Marked_twice(x)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  +(0,y) >= y ;
  +(s(x),y) >= s(+(x,y)) ;
   *(x,0) >= 0 ;
   *(x,s(y)) >= +(x, *(x,y)) ;
  twice(0) >= 0 ;
  twice(s(x)) >= s(s(twice(x))) ;
  -(s(x),s(y)) >= -(x,y) ;
  -(x,0) >= x ;
  f(s(x)) >= f(-( *(s(s(x)),s(s(x))),+( *(s(x),s(s(x))),s(s(0))))) ;
  Marked_f(s(x)) >= Marked_f(-( *(s(s(x)),s(s(x))),+( *(s(x),s(s(x))),s(s(0))))) ;
 }
 + Disjunctions:{ 
{
  Marked_f(s(x)) > Marked_f(-( *(s(s(x)),s(s(x))),+( *(s(x),s(s(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 : 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 69.833356 seconds (real time)
Cime Exit Status: 0