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

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


Sub problem: 
guided: 

DP termination of:
<Marked_le(s(x),s(y)) , Marked_le(x,y)>
<Marked_minus(s(x),s(y)) , Marked_minus(x,y)>
<Marked_gcd(s(x),s(y)) , Marked_if_gcd(le(y,x),s(x),s(y))>
<Marked_gcd(s(x),s(y)) , Marked_le(y,x)>
<Marked_if_gcd(true,x,y) , Marked_gcd(minus(x,y),y)>
<Marked_if_gcd(true,x,y) , Marked_minus(x,y)>
<Marked_if_gcd(false,x,y) , Marked_gcd(minus(y,x),x)>
<Marked_if_gcd(false,x,y) , Marked_minus(y,x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_if_gcd(false,x,y) , Marked_gcd(minus(y,x),x)> 
      --> <Marked_gcd(s(x),s(y)) , Marked_if_gcd(le(y,x),s(x),s(y))>
  <Marked_if_gcd(true,x,y) , Marked_gcd(minus(x,y),y)> 
     --> <Marked_gcd(s(x),s(y)) , Marked_if_gcd(le(y,x),s(x),s(y))>
  <Marked_gcd(s(x),s(y)) , Marked_if_gcd(le(y,x),s(x),s(y))> 
     --> <Marked_if_gcd(false,x,y) , Marked_gcd(minus(y,x),x)>
  <Marked_gcd(s(x),s(y)) , Marked_if_gcd(le(y,x),s(x),s(y))> 
     --> <Marked_if_gcd(true,x,y) , Marked_gcd(minus(x,y),y)>
}

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

{  <Marked_minus(s(x),s(y)) , Marked_minus(x,y)> 
      --> <Marked_minus(s(x),s(y)) , Marked_minus(x,y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  le(0,y) >= true ;
  le(s(x),0) >= false ;
  le(s(x),s(y)) >= le(x,y) ;
  minus(0,x) >= 0 ;
  minus(s(x),s(y)) >= minus(x,y) ;
  minus(x,0) >= x ;
  gcd(0,y) >= y ;
  gcd(s(x),0) >= s(x) ;
  gcd(s(x),s(y)) >= if_gcd(le(y,x),s(x),s(y)) ;
  if_gcd(true,x,y) >= gcd(minus(x,y),y) ;
  if_gcd(false,x,y) >= gcd(minus(y,x),x) ;
  Marked_if_gcd(true,x,y) >= Marked_gcd(minus(x,y),y) ;
  Marked_if_gcd(false,x,y) >= Marked_gcd(minus(y,x),x) ;
  Marked_gcd(s(x),s(y)) >= Marked_if_gcd(le(y,x),s(x),s(y)) ;
 }
 + Disjunctions:{ 
{
  Marked_if_gcd(true,x,y) > Marked_gcd(minus(x,y),y) ;
 }
{
  Marked_if_gcd(false,x,y) > Marked_gcd(minus(y,x),x) ;
 }
{
  Marked_gcd(s(x),s(y)) > Marked_if_gcd(le(y,x),s(x),s(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 : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
=== 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 1.816521 seconds (real time)
Cime Exit Status: 0