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

TRS termination of:
[1] g(f(x),y) -> f(h(x,y))
[2] h(x,y) -> g(x,f(y))


Sub problem: 
guided: 

DP termination of:
<Marked_g(f(x),y) , Marked_h(x,y)>
<Marked_h(x,y) , Marked_g(x,f(y))>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_h(x,y) , Marked_g(x,f(y))> --> <Marked_g(f(x),y) , Marked_h(x,y)>
  <Marked_g(f(x),y) , Marked_h(x,y)> --> <Marked_h(x,y) , Marked_g(x,f(y))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  h(x,y) >= g(x,f(y)) ;
  g(f(x),y) >= f(h(x,y)) ;
  Marked_h(x,y) >= Marked_g(x,f(y)) ;
  Marked_g(f(x),y) >= Marked_h(x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_h(x,y) > Marked_g(x,f(y)) ;
 }
{
  Marked_g(f(x),y) > Marked_h(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: h(x,y) >= g(x,f(y))
constraint: g(f(x),y) >= f(h(x,y))
constraint: Marked_h(x,y) >= Marked_g(x,f(y))
constraint: Marked_g(f(x),y) >= Marked_h(x,y)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] g(f(x),y) -> f(h(x,y))
[2] h(x,y) -> g(x,f(y))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_g(f(x),y) , Marked_h(x,y)>
<Marked_h(x,y) , Marked_g(x,f(y))>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_g(f(x),y) , Marked_h(x,y)>
<Marked_h(x,y) , Marked_g(x,f(y))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ f ] (X0) = 1 + 1*X0 + 0; 
 [ Marked_g ] (X0,X1) = 1 + 3*X0 + 0; 
 [ g ] (X0,X1) = 1*X0 + 0; 
 [ h ] (X0,X1) = 1*X0 + 0; 
 [ Marked_h ] (X0,X1) = 2 + 3*X0 + 0; 
 ]} 
 ]} 
 ]} 

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