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

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


Sub problem: 
guided: 

DP termination of:
<Marked_a , Marked_g(c)>
<Marked_f(g(X),b) , Marked_f(a,X)>
<Marked_f(g(X),b) , Marked_a>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

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

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