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

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


Sub problem: 
guided: 

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

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

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