- : unit = ()
- : 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] twice(0) -> 0
[8] twice(s(x)) -> s(s(twice(x)))
[9] -(x,0) -> x
[10] -(s(x),s(y)) -> -(x,y)
[11] p(s(x)) -> x
[12] f(s(x),s(y)) -> f(-(max(s(x),s(y)),min(s(x),s(y))),p(twice(min(x,y))))


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_twice(s(x)) , Marked_twice(x)>
<Marked_-(s(x),s(y)) , Marked_-(x,y)>
<Marked_f(s(x),s(y)) , Marked_f(-(max(s(x),s(y)),min(s(x),s(y))),
                        p(twice(min(x,y))))>
<Marked_f(s(x),s(y)) , Marked_-(max(s(x),s(y)),min(s(x),s(y)))>
<Marked_f(s(x),s(y)) , Marked_max(s(x),s(y))>
<Marked_f(s(x),s(y)) , Marked_min(s(x),s(y))>
<Marked_f(s(x),s(y)) , Marked_p(twice(min(x,y)))>
<Marked_f(s(x),s(y)) , Marked_twice(min(x,y))>
<Marked_f(s(x),s(y)) , Marked_min(x,y)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 5 components:

{  <Marked_f(s(x),s(y)) , Marked_f(-(max(s(x),s(y)),min(s(x),s(y))),
                           p(twice(min(x,y))))> 
      --> <Marked_f(s(x),s(y)) , Marked_f(-(max(s(x),s(y)),min(s(x),s(y))),
                                  p(twice(min(x,y))))>
}

{  <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_twice(s(x)) , Marked_twice(x)> 
      --> <Marked_twice(s(x)) , Marked_twice(x)>
}

{  <Marked_min(s(x),s(y)) , Marked_min(x,y)> 
      --> <Marked_min(s(x),s(y)) , Marked_min(x,y)>
}
APPLY CRITERIA (Subterm criterion)
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 ;
  twice(0) >= 0 ;
  twice(s(x)) >= s(s(twice(x))) ;
  -(s(x),s(y)) >= -(x,y) ;
  -(x,0) >= x ;
  p(s(x)) >= x ;
  f(s(x),s(y)) >= f(-(max(s(x),s(y)),min(s(x),s(y))),p(twice(min(x,y)))) ;
  Marked_f(s(x),s(y)) >= Marked_f(-(max(s(x),s(y)),min(s(x),s(y))),
                          p(twice(min(x,y)))) ;
 }
 + Disjunctions:{ 
{
  Marked_f(s(x),s(y)) > Marked_f(-(max(s(x),s(y)),min(s(x),s(y))),
                         p(twice(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 ===
=== 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 timeout reached
=== STOPING TIMER virtual ===
No solution found for these parameters.
No solution found for these constraints.
APPLY CRITERIA (Simple graph)
Found 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 ;
  twice(0) >= 0 ;
  twice(s(x)) >= s(s(twice(x))) ;
  -(s(x),s(y)) >= -(x,y) ;
  -(x,0) >= x ;
  p(s(x)) >= x ;
  f(s(x),s(y)) >= f(-(max(s(x),s(y)),min(s(x),s(y))),p(twice(min(x,y)))) ;
  Marked_f(s(x),s(y)) > Marked_f(-(max(s(x),s(y)),min(s(x),s(y))),
                         p(twice(min(x,y)))) ;
 }

APPLY CRITERIA (SOLVE_ORD)
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 ;
  twice(0) >= 0 ;
  twice(s(x)) >= s(s(twice(x))) ;
  -(s(x),s(y)) >= -(x,y) ;
  -(x,0) >= x ;
  p(s(x)) >= x ;
  f(s(x),s(y)) >= f(-(max(s(x),s(y)),min(s(x),s(y))),p(twice(min(x,y)))) ;
  Marked_f(s(x),s(y)) > Marked_f(-(max(s(x),s(y)),min(s(x),s(y))),
                         p(twice(min(x,y)))) ;
 }
 + 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.(759 bt (962) [53])
=== 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 timeout reached
=== 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
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 50.000000 ===
=== STOPING TIMER real ===
Sat timeout reached
=== 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 157.527126 seconds (real time)
Cime Exit Status: 0