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

TRS termination of:
[1] min(x,0) -> 0
[2] min(0,y) -> 0
[3] min(s(x),s(y)) -> s(min(x,y))
[4] max(x,0) -> x
[5] max(0,y) -> y
[6] max(s(x),s(y)) -> s(max(x,y))
[7] minus(x,0) -> x
[8] minus(s(x),s(y)) -> s(minus(x,any(y)))
[9] gcd(s(x),s(y)) -> gcd(minus(max(x,y),min(x,y)),s(min(x,y)))
[10] any(s(x)) -> s(s(any(x)))
[11] any(x) -> x


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_minus(s(x),s(y)) , Marked_minus(x,any(y))>
<Marked_minus(s(x),s(y)) , Marked_any(y)>
<Marked_gcd(s(x),s(y)) , Marked_gcd(minus(max(x,y),min(x,y)),s(min(x,y)))>
<Marked_gcd(s(x),s(y)) , Marked_minus(max(x,y),min(x,y))>
<Marked_gcd(s(x),s(y)) , Marked_max(x,y)>
<Marked_gcd(s(x),s(y)) , Marked_min(x,y)>
<Marked_gcd(s(x),s(y)) , Marked_min(x,y)>
<Marked_any(s(x)) , Marked_any(x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 5 components:

{  <Marked_gcd(s(x),s(y)) , Marked_gcd(minus(max(x,y),min(x,y)),s(min(x,y)))> 
      --> <Marked_gcd(s(x),s(y)) , Marked_gcd(minus(max(x,y),min(x,y)),
                                    s(min(x,y)))>
}

{  <Marked_minus(s(x),s(y)) , Marked_minus(x,any(y))> 
      --> <Marked_minus(s(x),s(y)) , Marked_minus(x,any(y))>
}

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

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

{  <Marked_any(s(x)) , Marked_any(x)> --> <Marked_any(s(x)) , Marked_any(x)>
}
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 ;
  minus(s(x),s(y)) >= s(minus(x,any(y))) ;
  minus(x,0) >= x ;
  any(s(x)) >= s(s(any(x))) ;
  any(x) >= x ;
  gcd(s(x),s(y)) >= gcd(minus(max(x,y),min(x,y)),s(min(x,y))) ;
  Marked_gcd(s(x),s(y)) >= Marked_gcd(minus(max(x,y),min(x,y)),s(min(x,y))) ;
 }
 + Disjunctions:{ 
{
  Marked_gcd(s(x),s(y)) > Marked_gcd(minus(max(x,y),min(x,y)),s(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 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 8.293028 seconds (real time)
Cime Exit Status: 0