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

TRS termination of:
[1] min(0,y) -> 0
[2] min(x,0) -> 0
[3] min(s(x),s(y)) -> s(min(x,y))
[4] max(0,y) -> y
[5] max(x,0) -> x
[6] max(s(x),s(y)) -> s(max(x,y))
[7] +(0,y) -> y
[8] +(s(x),y) -> s(+(x,y))
[9] -(x,0) -> x
[10] -(s(x),s(y)) -> -(x,y)
[11]  *(x,0) -> 0
[12]  *(x,s(y)) -> +(x, *(x,y))
[13] f(s(x)) ->
 f(-(max( *(s(x),s(x)),+(s(x),s(s(s(0))))),
    max(s( *(s(x),s(x))),+(s(x),s(s(s(s(0))))))))


Sub problem: 
guided: 

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

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

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

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

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