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

TRS termination of:
[1] f(f(x)) -> f(c(f(x)))
[2] f(f(x)) -> f(d(f(x)))
[3] g(c(x)) -> x
[4] g(d(x)) -> x
[5] g(c(h(0))) -> g(d(1))
[6] g(c(1)) -> g(d(h(0)))
[7] g(h(x)) -> g(x)


Sub problem: 
guided: 

DP termination of:
<Marked_f(f(x)) , Marked_f(c(f(x)))>
<Marked_f(f(x)) , Marked_f(d(f(x)))>
<Marked_g(c(h(0))) , Marked_g(d(1))>
<Marked_g(c(1)) , Marked_g(d(h(0)))>
<Marked_g(h(x)) , Marked_g(x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

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

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