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

TRS termination of:
[1] f(f(X)) -> c(n__f(n__g(n__f(X))))
[2] c(X) -> d(activate(X))
[3] h(X) -> c(n__d(X))
[4] f(X) -> n__f(X)
[5] g(X) -> n__g(X)
[6] d(X) -> n__d(X)
[7] activate(n__f(X)) -> f(activate(X))
[8] activate(n__g(X)) -> g(X)
[9] activate(n__d(X)) -> d(X)
[10] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_f(f(X)) , Marked_c(n__f(n__g(n__f(X))))>
<Marked_c(X) , Marked_d(activate(X))>
<Marked_c(X) , Marked_activate(X)>
<Marked_h(X) , Marked_c(n__d(X))>
<Marked_activate(n__f(X)) , Marked_f(activate(X))>
<Marked_activate(n__f(X)) , Marked_activate(X)>
<Marked_activate(n__g(X)) , Marked_g(X)>
<Marked_activate(n__d(X)) , Marked_d(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__f(X)) , Marked_activate(X)> 
      --> <Marked_activate(n__f(X)) , Marked_activate(X)>
  <Marked_activate(n__f(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__f(X)) , Marked_f(activate(X))>
  <Marked_activate(n__f(X)) , Marked_f(activate(X))> 
     --> <Marked_f(f(X)) , Marked_c(n__f(n__g(n__f(X))))>
  <Marked_c(X) , Marked_activate(X)> 
     --> <Marked_activate(n__f(X)) , Marked_activate(X)>
  <Marked_c(X) , Marked_activate(X)> 
     --> <Marked_activate(n__f(X)) , Marked_f(activate(X))>
  <Marked_f(f(X)) , Marked_c(n__f(n__g(n__f(X))))> 
     --> <Marked_c(X) , Marked_activate(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  c(X) >= d(activate(X)) ;
  f(f(X)) >= c(n__f(n__g(n__f(X)))) ;
  f(X) >= n__f(X) ;
  d(X) >= n__d(X) ;
  activate(n__f(X)) >= f(activate(X)) ;
  activate(n__g(X)) >= g(X) ;
  activate(n__d(X)) >= d(X) ;
  activate(X) >= X ;
  h(X) >= c(n__d(X)) ;
  g(X) >= n__g(X) ;
  Marked_activate(n__f(X)) >= Marked_activate(X) ;
  Marked_activate(n__f(X)) >= Marked_f(activate(X)) ;
  Marked_f(f(X)) >= Marked_c(n__f(n__g(n__f(X)))) ;
  Marked_c(X) >= Marked_activate(X) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__f(X)) > Marked_activate(X) ;
 }
{
  Marked_activate(n__f(X)) > Marked_f(activate(X)) ;
 }
{
  Marked_f(f(X)) > Marked_c(n__f(n__g(n__f(X)))) ;
 }
{
  Marked_c(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: c(X) >= d(activate(X))
constraint: f(f(X)) >= c(n__f(n__g(n__f(X))))
constraint: f(X) >= n__f(X)
constraint: d(X) >= n__d(X)
constraint: activate(n__f(X)) >= f(activate(X))
constraint: activate(n__g(X)) >= g(X)
constraint: activate(n__d(X)) >= d(X)
constraint: activate(X) >= X
constraint: h(X) >= c(n__d(X))
constraint: g(X) >= n__g(X)
constraint: Marked_activate(n__f(X)) >= Marked_activate(X)
constraint: Marked_activate(n__f(X)) >= Marked_f(activate(X))
constraint: Marked_f(f(X)) >= Marked_c(n__f(n__g(n__f(X))))
constraint: Marked_c(X) >= Marked_activate(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] f(f(X)) -> c(n__f(n__g(n__f(X))))
[2] c(X) -> d(activate(X))
[3] h(X) -> c(n__d(X))
[4] f(X) -> n__f(X)
[5] g(X) -> n__g(X)
[6] d(X) -> n__d(X)
[7] activate(n__f(X)) -> f(activate(X))
[8] activate(n__g(X)) -> g(X)
[9] activate(n__d(X)) -> d(X)
[10] activate(X) -> X
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_f(f(X)) , Marked_c(n__f(n__g(n__f(X))))>
<Marked_c(X) , Marked_d(activate(X))>
<Marked_c(X) , Marked_activate(X)>
<Marked_h(X) , Marked_c(n__d(X))>
<Marked_activate(n__f(X)) , Marked_f(activate(X))>
<Marked_activate(n__f(X)) , Marked_activate(X)>
<Marked_activate(n__g(X)) , Marked_g(X)>
<Marked_activate(n__d(X)) , Marked_d(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_f(f(X)) , Marked_c(n__f(n__g(n__f(X))))>
<Marked_c(X) , Marked_activate(X)>
<Marked_activate(n__f(X)) , Marked_f(activate(X))>
<Marked_activate(n__f(X)) , Marked_activate(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ c ] (X0) = 0; 
 [ g ] (X0) = 0; 
 [ d ] (X0) = 0; 
 [ Marked_f ] (X0) = 1*X0 + 2; 
 [ n__g ] (X0) = 0; 
 [ n__d ] (X0) = 0; 
 [ Marked_c ] (X0) = 2*X0; 
 [ n__f ] (X0) = 1*X0 + 2; 
 [ Marked_activate ] (X0) = 2*X0; 
 [ activate ] (X0) = 2*X0; 
 [ f ] (X0) = 1*X0 + 2; 
 [ h ] (X0) = 1*X0 + 1; 
 removing <Marked_activate(n__f(X)),Marked_f(activate(X))><Marked_activate(
                                                            n__f(X)),
Marked_activate(X)>
 [ {
      
     DP termination of:
     <Marked_f(f(X)) , Marked_c(n__f(n__g(n__f(X))))>
<Marked_c(X) , Marked_activate(X)>
 ,
 CRITERION: SG
 [  ]} 
 ]} 
 ]} 
 ]} 

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