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

TRS termination of:
[1] g(a) -> g(b)
[2] b -> f(a,a)
[3] f(a,a) -> g(d)


Sub problem: 
guided: 

DP termination of:
<Marked_g(a) , Marked_g(b)>
<Marked_g(a) , Marked_b>
<Marked_b , Marked_f(a,a)>
<Marked_f(a,a) , Marked_g(d)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

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

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