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

TRS termination of:
[1] f(n__f(n__a)) -> f(n__g(n__f(n__a)))
[2] f(X) -> n__f(X)
[3] a -> n__a
[4] g(X) -> n__g(X)
[5] activate(n__f(X)) -> f(X)
[6] activate(n__a) -> a
[7] activate(n__g(X)) -> g(activate(X))
[8] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_f(n__f(n__a)) , Marked_f(n__g(n__f(n__a)))>
<Marked_activate(n__f(X)) , Marked_f(X)>
<Marked_activate(n__a) , Marked_a>
<Marked_activate(n__g(X)) , Marked_g(activate(X))>
<Marked_activate(n__g(X)) , Marked_activate(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

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

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