- : 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] -(x,0) -> x
[8] -(s(x),s(y)) -> -(x,y)
[9] gcd(s(x),0) -> s(x)
[10] gcd(0,s(x)) -> s(x)
[11] gcd(s(x),s(y)) -> gcd(-(max(x,y),min(x,y)),s(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_-(s(x),s(y)) , Marked_-(x,y)>
<Marked_gcd(s(x),s(y)) , Marked_gcd(-(max(x,y),min(x,y)),s(min(x,y)))>
<Marked_gcd(s(x),s(y)) , Marked_-(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)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 4 components:

{  <Marked_gcd(s(x),s(y)) , Marked_gcd(-(max(x,y),min(x,y)),s(min(x,y)))> 
      --> <Marked_gcd(s(x),s(y)) , Marked_gcd(-(max(x,y),min(x,y)),s(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_min(s(x),s(y)) , Marked_min(x,y)> 
      --> <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 ;
  -(s(x),s(y)) >= -(x,y) ;
  -(x,0) >= x ;
  gcd(0,s(x)) >= s(x) ;
  gcd(s(x),0) >= s(x) ;
  gcd(s(x),s(y)) >= gcd(-(max(x,y),min(x,y)),s(min(x,y))) ;
  Marked_gcd(s(x),s(y)) >= Marked_gcd(-(max(x,y),min(x,y)),s(min(x,y))) ;
 }
 + Disjunctions:{ 
{
  Marked_gcd(s(x),s(y)) > Marked_gcd(-(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
Sat solver result read
=== STOPING TIMER real ===
=== 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: -(s(x),s(y)) >= -(x,y)
constraint: -(x,0) >= x
constraint: gcd(0,s(x)) >= s(x)
constraint: gcd(s(x),0) >= s(x)
constraint: gcd(s(x),s(y)) >= gcd(-(max(x,y),min(x,y)),s(min(x,y)))
constraint: Marked_gcd(s(x),s(y)) >= Marked_gcd(-(max(x,y),min(x,y)),
                                      s(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 ;
  -(s(x),s(y)) >= -(x,y) ;
  -(x,0) >= x ;
  gcd(0,s(x)) >= s(x) ;
  gcd(s(x),0) >= s(x) ;
  gcd(s(x),s(y)) >= gcd(-(max(x,y),min(x,y)),s(min(x,y))) ;
  Marked_-(s(x),s(y)) >= Marked_-(x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_-(s(x),s(y)) > Marked_-(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
Sat solver result read
=== STOPING TIMER real ===
=== 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: -(s(x),s(y)) >= -(x,y)
constraint: -(x,0) >= x
constraint: gcd(0,s(x)) >= s(x)
constraint: gcd(s(x),0) >= s(x)
constraint: gcd(s(x),s(y)) >= gcd(-(max(x,y),min(x,y)),s(min(x,y)))
constraint: Marked_-(s(x),s(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 ;
  -(s(x),s(y)) >= -(x,y) ;
  -(x,0) >= x ;
  gcd(0,s(x)) >= s(x) ;
  gcd(s(x),0) >= s(x) ;
  gcd(s(x),s(y)) >= gcd(-(max(x,y),min(x,y)),s(min(x,y))) ;
  Marked_max(s(x),s(y)) >= Marked_max(x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_max(s(x),s(y)) > Marked_max(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
Sat solver result read
=== STOPING TIMER real ===
=== 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: -(s(x),s(y)) >= -(x,y)
constraint: -(x,0) >= x
constraint: gcd(0,s(x)) >= s(x)
constraint: gcd(s(x),0) >= s(x)
constraint: gcd(s(x),s(y)) >= gcd(-(max(x,y),min(x,y)),s(min(x,y)))
constraint: Marked_max(s(x),s(y)) >= Marked_max(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 ;
  -(s(x),s(y)) >= -(x,y) ;
  -(x,0) >= x ;
  gcd(0,s(x)) >= s(x) ;
  gcd(s(x),0) >= s(x) ;
  gcd(s(x),s(y)) >= gcd(-(max(x,y),min(x,y)),s(min(x,y))) ;
  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
Sat solver result read
=== STOPING TIMER real ===
=== 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: -(s(x),s(y)) >= -(x,y)
constraint: -(x,0) >= x
constraint: gcd(0,s(x)) >= s(x)
constraint: gcd(s(x),0) >= s(x)
constraint: gcd(s(x),s(y)) >= gcd(-(max(x,y),min(x,y)),s(min(x,y)))
constraint: Marked_min(s(x),s(y)) >= Marked_min(x,y)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
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] -(x,0) -> x
[8] -(s(x),s(y)) -> -(x,y)
[9] gcd(s(x),0) -> s(x)
[10] gcd(0,s(x)) -> s(x)
[11] gcd(s(x),s(y)) -> gcd(-(max(x,y),min(x,y)),s(min(x,y)))
 ,
 CRITERION: MDP
 [ {
      
     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),s(y)) , Marked_-(x,y)>
<Marked_gcd(s(x),s(y)) , Marked_gcd(-(max(x,y),min(x,y)),s(min(x,y)))>
<Marked_gcd(s(x),s(y)) , Marked_-(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)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_gcd(s(x),s(y)) , Marked_gcd(-(max(x,y),min(x,y)),s(min(x,y)))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ 0 ] () = 0; 
 [ - ] (X0,X1) = 1*X0 + 0; 
 [ s ] (X0) = 1 + 2*X0 + 0; 
 [ Marked_gcd ] (X0,X1) = 2*X0 + 1*X1 + 0; 
 [ min ] (X0,X1) = 1*X0 + 0; 
 [ gcd ] (X0,X1) = 2*X0 + 1*X1 + 0; 
 [ max ] (X0,X1) = 1*X0 + 1*X1 + 0; 
 ]} 
{
 
DP termination of:
<Marked_-(s(x),s(y)) , Marked_-(x,y)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ 0 ] () = 0; 
 [ - ] (X0,X1) = 1*X0 + 0; 
 [ s ] (X0) = 1 + 2*X0 + 0; 
 [ min ] (X0,X1) = 1*X0 + 0; 
 [ gcd ] (X0,X1) = 2*X0 + 1*X1 + 0; 
 [ max ] (X0,X1) = 1*X0 + 1*X1 + 0; 
 [ Marked_- ] (X0,X1) = 1*X1 + 0; 
 ]} 
{
 
DP termination of:
<Marked_max(s(x),s(y)) , Marked_max(x,y)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ 0 ] () = 0; 
 [ Marked_max ] (X0,X1) = 1*X0 + 0; 
 [ - ] (X0,X1) = 1 + 1*X0 + 0; 
 [ s ] (X0) = 1 + 2*X0 + 0; 
 [ min ] (X0,X1) = 1*X0 + 0; 
 [ gcd ] (X0,X1) = 2*X0 + 1*X1 + 0; 
 [ max ] (X0,X1) = 1*X0 + 1*X1 + 0; 
 ]} 
{
 
DP termination of:
<Marked_min(s(x),s(y)) , Marked_min(x,y)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ 0 ] () = 0; 
 [ - ] (X0,X1) = 1*X0 + 0; 
 [ s ] (X0) = 2 + 2*X0 + 0; 
 [ min ] (X0,X1) = 1*X0 + 0; 
 [ Marked_min ] (X0,X1) = 1*X0 + 0; 
 [ gcd ] (X0,X1) = 2*X0 + 1*X1 + 0; 
 [ max ] (X0,X1) = 1*X0 + 1*X1 + 0; 
 ]} 
 ]} 
 ]} 

Cime worked for 0.219898 seconds (real time)
Cime Exit Status: 0