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

TRS termination of:
[1] active(f(f(a))) -> mark(c(f(g(f(a)))))
[2] mark(f(X)) -> active(f(mark(X)))
[3] mark(a) -> active(a)
[4] mark(c(X)) -> active(c(X))
[5] mark(g(X)) -> active(g(mark(X)))
[6] f(mark(X)) -> f(X)
[7] f(active(X)) -> f(X)
[8] c(mark(X)) -> c(X)
[9] c(active(X)) -> c(X)
[10] g(mark(X)) -> g(X)
[11] g(active(X)) -> g(X)


Sub problem: 
guided: 

DP termination of:
<Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
<Marked_active(f(f(a))) , Marked_c(f(g(f(a))))>
<Marked_active(f(f(a))) , Marked_f(g(f(a)))>
<Marked_active(f(f(a))) , Marked_g(f(a))>
<Marked_mark(f(X)) , Marked_active(f(mark(X)))>
<Marked_mark(f(X)) , Marked_f(mark(X))>
<Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(a) , Marked_active(a)>
<Marked_mark(c(X)) , Marked_active(c(X))>
<Marked_mark(g(X)) , Marked_active(g(mark(X)))>
<Marked_mark(g(X)) , Marked_g(mark(X))>
<Marked_mark(g(X)) , Marked_mark(X)>
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_f(active(X)) , Marked_f(X)>
<Marked_c(mark(X)) , Marked_c(X)>
<Marked_c(active(X)) , Marked_c(X)>
<Marked_g(mark(X)) , Marked_g(X)>
<Marked_g(active(X)) , Marked_g(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 4 components:

{  <Marked_mark(g(X)) , Marked_mark(X)> 
      --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_mark(g(X)) , Marked_mark(X)> 
     --> <Marked_mark(g(X)) , Marked_active(g(mark(X)))>
  <Marked_mark(g(X)) , Marked_mark(X)> 
     --> <Marked_mark(c(X)) , Marked_active(c(X))>
  <Marked_mark(g(X)) , Marked_mark(X)> --> <Marked_mark(f(X)) , Marked_mark(X)>
  <Marked_mark(g(X)) , Marked_mark(X)> 
     --> <Marked_mark(f(X)) , Marked_active(f(mark(X)))>
  <Marked_mark(g(X)) , Marked_active(g(mark(X)))> 
     --> <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
  <Marked_mark(c(X)) , Marked_active(c(X))> 
     --> <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
  <Marked_mark(f(X)) , Marked_mark(X)> --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_mark(f(X)) , Marked_mark(X)> 
     --> <Marked_mark(g(X)) , Marked_active(g(mark(X)))>
  <Marked_mark(f(X)) , Marked_mark(X)> 
     --> <Marked_mark(c(X)) , Marked_active(c(X))>
  <Marked_mark(f(X)) , Marked_mark(X)> --> <Marked_mark(f(X)) , Marked_mark(X)>
  <Marked_mark(f(X)) , Marked_mark(X)> 
     --> <Marked_mark(f(X)) , Marked_active(f(mark(X)))>
  <Marked_mark(f(X)) , Marked_active(f(mark(X)))> 
     --> <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(g(X)) , Marked_active(g(mark(X)))>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(c(X)) , Marked_active(c(X))>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(f(X)) , Marked_mark(X)>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(f(X)) , Marked_active(f(mark(X)))>
}

{  <Marked_f(active(X)) , Marked_f(X)> --> <Marked_f(active(X)) , Marked_f(X)>
  <Marked_f(active(X)) , Marked_f(X)> --> <Marked_f(mark(X)) , Marked_f(X)>
  <Marked_f(mark(X)) , Marked_f(X)> --> <Marked_f(active(X)) , Marked_f(X)>
  <Marked_f(mark(X)) , Marked_f(X)> --> <Marked_f(mark(X)) , Marked_f(X)>
}

{  <Marked_c(active(X)) , Marked_c(X)> --> <Marked_c(active(X)) , Marked_c(X)>
  <Marked_c(active(X)) , Marked_c(X)> --> <Marked_c(mark(X)) , Marked_c(X)>
  <Marked_c(mark(X)) , Marked_c(X)> --> <Marked_c(active(X)) , Marked_c(X)>
  <Marked_c(mark(X)) , Marked_c(X)> --> <Marked_c(mark(X)) , Marked_c(X)>
}

{  <Marked_g(active(X)) , Marked_g(X)> --> <Marked_g(active(X)) , Marked_g(X)>
  <Marked_g(active(X)) , Marked_g(X)> --> <Marked_g(mark(X)) , Marked_g(X)>
  <Marked_g(mark(X)) , Marked_g(X)> --> <Marked_g(active(X)) , Marked_g(X)>
  <Marked_g(mark(X)) , Marked_g(X)> --> <Marked_g(mark(X)) , Marked_g(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(c(X)) >= active(c(X)) ;
  mark(f(X)) >= active(f(mark(X))) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(a) >= active(a) ;
  c(mark(X)) >= c(X) ;
  c(active(X)) >= c(X) ;
  f(mark(X)) >= f(X) ;
  f(active(X)) >= f(X) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  active(f(f(a))) >= mark(c(f(g(f(a))))) ;
  Marked_mark(c(X)) >= Marked_active(c(X)) ;
  Marked_mark(f(X)) >= Marked_mark(X) ;
  Marked_mark(f(X)) >= Marked_active(f(mark(X))) ;
  Marked_mark(g(X)) >= Marked_mark(X) ;
  Marked_mark(g(X)) >= Marked_active(g(mark(X))) ;
  Marked_active(f(f(a))) >= Marked_mark(c(f(g(f(a))))) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(c(X)) > Marked_active(c(X)) ;
 }
{
  Marked_mark(f(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(f(X)) > Marked_active(f(mark(X))) ;
 }
{
  Marked_mark(g(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(g(X)) > Marked_active(g(mark(X))) ;
 }
{
  Marked_active(f(f(a))) > Marked_mark(c(f(g(f(a))))) ;
 }
 } 
=== 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: mark(c(X)) >= active(c(X))
constraint: mark(f(X)) >= active(f(mark(X)))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(a) >= active(a)
constraint: c(mark(X)) >= c(X)
constraint: c(active(X)) >= c(X)
constraint: f(mark(X)) >= f(X)
constraint: f(active(X)) >= f(X)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: active(f(f(a))) >= mark(c(f(g(f(a)))))
constraint: Marked_mark(c(X)) >= Marked_active(c(X))
constraint: Marked_mark(f(X)) >= Marked_mark(X)
constraint: Marked_mark(f(X)) >= Marked_active(f(mark(X)))
constraint: Marked_mark(g(X)) >= Marked_mark(X)
constraint: Marked_mark(g(X)) >= Marked_active(g(mark(X)))
constraint: Marked_active(f(f(a))) >= Marked_mark(c(f(g(f(a)))))
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(c(X)) >= active(c(X)) ;
  mark(f(X)) >= active(f(mark(X))) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(a) >= active(a) ;
  c(mark(X)) >= c(X) ;
  c(active(X)) >= c(X) ;
  f(mark(X)) >= f(X) ;
  f(active(X)) >= f(X) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  active(f(f(a))) >= mark(c(f(g(f(a))))) ;
  Marked_f(mark(X)) >= Marked_f(X) ;
  Marked_f(active(X)) >= Marked_f(X) ;
 }
 + Disjunctions:{ 
{
  Marked_f(mark(X)) > Marked_f(X) ;
 }
{
  Marked_f(active(X)) > Marked_f(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: mark(c(X)) >= active(c(X))
constraint: mark(f(X)) >= active(f(mark(X)))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(a) >= active(a)
constraint: c(mark(X)) >= c(X)
constraint: c(active(X)) >= c(X)
constraint: f(mark(X)) >= f(X)
constraint: f(active(X)) >= f(X)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: active(f(f(a))) >= mark(c(f(g(f(a)))))
constraint: Marked_f(mark(X)) >= Marked_f(X)
constraint: Marked_f(active(X)) >= Marked_f(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(c(X)) >= active(c(X)) ;
  mark(f(X)) >= active(f(mark(X))) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(a) >= active(a) ;
  c(mark(X)) >= c(X) ;
  c(active(X)) >= c(X) ;
  f(mark(X)) >= f(X) ;
  f(active(X)) >= f(X) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  active(f(f(a))) >= mark(c(f(g(f(a))))) ;
  Marked_c(mark(X)) >= Marked_c(X) ;
  Marked_c(active(X)) >= Marked_c(X) ;
 }
 + Disjunctions:{ 
{
  Marked_c(mark(X)) > Marked_c(X) ;
 }
{
  Marked_c(active(X)) > Marked_c(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: mark(c(X)) >= active(c(X))
constraint: mark(f(X)) >= active(f(mark(X)))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(a) >= active(a)
constraint: c(mark(X)) >= c(X)
constraint: c(active(X)) >= c(X)
constraint: f(mark(X)) >= f(X)
constraint: f(active(X)) >= f(X)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: active(f(f(a))) >= mark(c(f(g(f(a)))))
constraint: Marked_c(mark(X)) >= Marked_c(X)
constraint: Marked_c(active(X)) >= Marked_c(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(c(X)) >= active(c(X)) ;
  mark(f(X)) >= active(f(mark(X))) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(a) >= active(a) ;
  c(mark(X)) >= c(X) ;
  c(active(X)) >= c(X) ;
  f(mark(X)) >= f(X) ;
  f(active(X)) >= f(X) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  active(f(f(a))) >= mark(c(f(g(f(a))))) ;
  Marked_g(mark(X)) >= Marked_g(X) ;
  Marked_g(active(X)) >= Marked_g(X) ;
 }
 + Disjunctions:{ 
{
  Marked_g(mark(X)) > Marked_g(X) ;
 }
{
  Marked_g(active(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: mark(c(X)) >= active(c(X))
constraint: mark(f(X)) >= active(f(mark(X)))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(a) >= active(a)
constraint: c(mark(X)) >= c(X)
constraint: c(active(X)) >= c(X)
constraint: f(mark(X)) >= f(X)
constraint: f(active(X)) >= f(X)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: active(f(f(a))) >= mark(c(f(g(f(a)))))
constraint: Marked_g(mark(X)) >= Marked_g(X)
constraint: Marked_g(active(X)) >= Marked_g(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(g(X)) , Marked_mark(X)> 
      --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_mark(g(X)) , Marked_mark(X)> 
     --> <Marked_mark(g(X)) , Marked_active(g(mark(X)))>
  <Marked_mark(g(X)) , Marked_mark(X)> --> <Marked_mark(f(X)) , Marked_mark(X)>
  <Marked_mark(g(X)) , Marked_mark(X)> 
     --> <Marked_mark(f(X)) , Marked_active(f(mark(X)))>
  <Marked_mark(g(X)) , Marked_active(g(mark(X)))> 
     --> <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
  <Marked_mark(f(X)) , Marked_mark(X)> --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_mark(f(X)) , Marked_mark(X)> 
     --> <Marked_mark(g(X)) , Marked_active(g(mark(X)))>
  <Marked_mark(f(X)) , Marked_mark(X)> --> <Marked_mark(f(X)) , Marked_mark(X)>
  <Marked_mark(f(X)) , Marked_mark(X)> 
     --> <Marked_mark(f(X)) , Marked_active(f(mark(X)))>
  <Marked_mark(f(X)) , Marked_active(f(mark(X)))> 
     --> <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(g(X)) , Marked_active(g(mark(X)))>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(f(X)) , Marked_mark(X)>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(f(X)) , Marked_active(f(mark(X)))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(c(X)) >= active(c(X)) ;
  mark(f(X)) >= active(f(mark(X))) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(a) >= active(a) ;
  c(mark(X)) >= c(X) ;
  c(active(X)) >= c(X) ;
  f(mark(X)) >= f(X) ;
  f(active(X)) >= f(X) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  active(f(f(a))) >= mark(c(f(g(f(a))))) ;
  Marked_mark(f(X)) >= Marked_mark(X) ;
  Marked_mark(f(X)) >= Marked_active(f(mark(X))) ;
  Marked_mark(g(X)) >= Marked_mark(X) ;
  Marked_mark(g(X)) >= Marked_active(g(mark(X))) ;
  Marked_active(f(f(a))) >= Marked_mark(c(f(g(f(a))))) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(f(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(f(X)) > Marked_active(f(mark(X))) ;
 }
{
  Marked_mark(g(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(g(X)) > Marked_active(g(mark(X))) ;
 }
{
  Marked_active(f(f(a))) > Marked_mark(c(f(g(f(a))))) ;
 }
 } 
=== 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: mark(c(X)) >= active(c(X))
constraint: mark(f(X)) >= active(f(mark(X)))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(a) >= active(a)
constraint: c(mark(X)) >= c(X)
constraint: c(active(X)) >= c(X)
constraint: f(mark(X)) >= f(X)
constraint: f(active(X)) >= f(X)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: active(f(f(a))) >= mark(c(f(g(f(a)))))
constraint: Marked_mark(f(X)) >= Marked_mark(X)
constraint: Marked_mark(f(X)) >= Marked_active(f(mark(X)))
constraint: Marked_mark(g(X)) >= Marked_mark(X)
constraint: Marked_mark(g(X)) >= Marked_active(g(mark(X)))
constraint: Marked_active(f(f(a))) >= Marked_mark(c(f(g(f(a)))))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(g(X)) , Marked_mark(X)> 
      --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_mark(g(X)) , Marked_mark(X)> --> <Marked_mark(f(X)) , Marked_mark(X)>
  <Marked_mark(g(X)) , Marked_mark(X)> 
     --> <Marked_mark(f(X)) , Marked_active(f(mark(X)))>
  <Marked_mark(f(X)) , Marked_mark(X)> --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_mark(f(X)) , Marked_mark(X)> --> <Marked_mark(f(X)) , Marked_mark(X)>
  <Marked_mark(f(X)) , Marked_mark(X)> 
     --> <Marked_mark(f(X)) , Marked_active(f(mark(X)))>
  <Marked_mark(f(X)) , Marked_active(f(mark(X)))> 
     --> <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(f(X)) , Marked_mark(X)>
  <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))> 
     --> <Marked_mark(f(X)) , Marked_active(f(mark(X)))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(c(X)) >= active(c(X)) ;
  mark(f(X)) >= active(f(mark(X))) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(a) >= active(a) ;
  c(mark(X)) >= c(X) ;
  c(active(X)) >= c(X) ;
  f(mark(X)) >= f(X) ;
  f(active(X)) >= f(X) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  active(f(f(a))) >= mark(c(f(g(f(a))))) ;
  Marked_mark(f(X)) >= Marked_mark(X) ;
  Marked_mark(f(X)) >= Marked_active(f(mark(X))) ;
  Marked_mark(g(X)) >= Marked_mark(X) ;
  Marked_active(f(f(a))) >= Marked_mark(c(f(g(f(a))))) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(f(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(f(X)) > Marked_active(f(mark(X))) ;
 }
{
  Marked_mark(g(X)) > Marked_mark(X) ;
 }
{
  Marked_active(f(f(a))) > Marked_mark(c(f(g(f(a))))) ;
 }
 } 
=== 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: mark(c(X)) >= active(c(X))
constraint: mark(f(X)) >= active(f(mark(X)))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(a) >= active(a)
constraint: c(mark(X)) >= c(X)
constraint: c(active(X)) >= c(X)
constraint: f(mark(X)) >= f(X)
constraint: f(active(X)) >= f(X)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: active(f(f(a))) >= mark(c(f(g(f(a)))))
constraint: Marked_mark(f(X)) >= Marked_mark(X)
constraint: Marked_mark(f(X)) >= Marked_active(f(mark(X)))
constraint: Marked_mark(g(X)) >= Marked_mark(X)
constraint: Marked_active(f(f(a))) >= Marked_mark(c(f(g(f(a)))))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(g(X)) , Marked_mark(X)> 
      --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_mark(g(X)) , Marked_mark(X)> --> <Marked_mark(f(X)) , Marked_mark(X)>
  <Marked_mark(f(X)) , Marked_mark(X)> --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_mark(f(X)) , Marked_mark(X)> --> <Marked_mark(f(X)) , Marked_mark(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(c(X)) >= active(c(X)) ;
  mark(f(X)) >= active(f(mark(X))) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(a) >= active(a) ;
  c(mark(X)) >= c(X) ;
  c(active(X)) >= c(X) ;
  f(mark(X)) >= f(X) ;
  f(active(X)) >= f(X) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  active(f(f(a))) >= mark(c(f(g(f(a))))) ;
  Marked_mark(f(X)) >= Marked_mark(X) ;
  Marked_mark(g(X)) >= Marked_mark(X) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(f(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(g(X)) > Marked_mark(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: mark(c(X)) >= active(c(X))
constraint: mark(f(X)) >= active(f(mark(X)))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(a) >= active(a)
constraint: c(mark(X)) >= c(X)
constraint: c(active(X)) >= c(X)
constraint: f(mark(X)) >= f(X)
constraint: f(active(X)) >= f(X)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: active(f(f(a))) >= mark(c(f(g(f(a)))))
constraint: Marked_mark(f(X)) >= Marked_mark(X)
constraint: Marked_mark(g(X)) >= Marked_mark(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(f(X)) , Marked_mark(X)> 
      --> <Marked_mark(f(X)) , Marked_mark(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(c(X)) >= active(c(X)) ;
  mark(f(X)) >= active(f(mark(X))) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(a) >= active(a) ;
  c(mark(X)) >= c(X) ;
  c(active(X)) >= c(X) ;
  f(mark(X)) >= f(X) ;
  f(active(X)) >= f(X) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  active(f(f(a))) >= mark(c(f(g(f(a))))) ;
  Marked_mark(f(X)) >= Marked_mark(X) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(f(X)) > Marked_mark(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: mark(c(X)) >= active(c(X))
constraint: mark(f(X)) >= active(f(mark(X)))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(a) >= active(a)
constraint: c(mark(X)) >= c(X)
constraint: c(active(X)) >= c(X)
constraint: f(mark(X)) >= f(X)
constraint: f(active(X)) >= f(X)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: active(f(f(a))) >= mark(c(f(g(f(a)))))
constraint: Marked_mark(f(X)) >= Marked_mark(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_f(active(X)) , Marked_f(X)> --> <Marked_f(active(X)) , Marked_f(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(c(X)) >= active(c(X)) ;
  mark(f(X)) >= active(f(mark(X))) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(a) >= active(a) ;
  c(mark(X)) >= c(X) ;
  c(active(X)) >= c(X) ;
  f(mark(X)) >= f(X) ;
  f(active(X)) >= f(X) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  active(f(f(a))) >= mark(c(f(g(f(a))))) ;
  Marked_f(active(X)) >= Marked_f(X) ;
 }
 + Disjunctions:{ 
{
  Marked_f(active(X)) > Marked_f(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: mark(c(X)) >= active(c(X))
constraint: mark(f(X)) >= active(f(mark(X)))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(a) >= active(a)
constraint: c(mark(X)) >= c(X)
constraint: c(active(X)) >= c(X)
constraint: f(mark(X)) >= f(X)
constraint: f(active(X)) >= f(X)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: active(f(f(a))) >= mark(c(f(g(f(a)))))
constraint: Marked_f(active(X)) >= Marked_f(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_c(active(X)) , Marked_c(X)> --> <Marked_c(active(X)) , Marked_c(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(c(X)) >= active(c(X)) ;
  mark(f(X)) >= active(f(mark(X))) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(a) >= active(a) ;
  c(mark(X)) >= c(X) ;
  c(active(X)) >= c(X) ;
  f(mark(X)) >= f(X) ;
  f(active(X)) >= f(X) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  active(f(f(a))) >= mark(c(f(g(f(a))))) ;
  Marked_c(active(X)) >= Marked_c(X) ;
 }
 + Disjunctions:{ 
{
  Marked_c(active(X)) > Marked_c(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: mark(c(X)) >= active(c(X))
constraint: mark(f(X)) >= active(f(mark(X)))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(a) >= active(a)
constraint: c(mark(X)) >= c(X)
constraint: c(active(X)) >= c(X)
constraint: f(mark(X)) >= f(X)
constraint: f(active(X)) >= f(X)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: active(f(f(a))) >= mark(c(f(g(f(a)))))
constraint: Marked_c(active(X)) >= Marked_c(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_g(active(X)) , Marked_g(X)> --> <Marked_g(active(X)) , Marked_g(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(c(X)) >= active(c(X)) ;
  mark(f(X)) >= active(f(mark(X))) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(a) >= active(a) ;
  c(mark(X)) >= c(X) ;
  c(active(X)) >= c(X) ;
  f(mark(X)) >= f(X) ;
  f(active(X)) >= f(X) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  active(f(f(a))) >= mark(c(f(g(f(a))))) ;
  Marked_g(active(X)) >= Marked_g(X) ;
 }
 + Disjunctions:{ 
{
  Marked_g(active(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: mark(c(X)) >= active(c(X))
constraint: mark(f(X)) >= active(f(mark(X)))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(a) >= active(a)
constraint: c(mark(X)) >= c(X)
constraint: c(active(X)) >= c(X)
constraint: f(mark(X)) >= f(X)
constraint: f(active(X)) >= f(X)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: active(f(f(a))) >= mark(c(f(g(f(a)))))
constraint: Marked_g(active(X)) >= Marked_g(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] active(f(f(a))) -> mark(c(f(g(f(a)))))
[2] mark(f(X)) -> active(f(mark(X)))
[3] mark(a) -> active(a)
[4] mark(c(X)) -> active(c(X))
[5] mark(g(X)) -> active(g(mark(X)))
[6] f(mark(X)) -> f(X)
[7] f(active(X)) -> f(X)
[8] c(mark(X)) -> c(X)
[9] c(active(X)) -> c(X)
[10] g(mark(X)) -> g(X)
[11] g(active(X)) -> g(X)
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
<Marked_active(f(f(a))) , Marked_c(f(g(f(a))))>
<Marked_active(f(f(a))) , Marked_f(g(f(a)))>
<Marked_active(f(f(a))) , Marked_g(f(a))>
<Marked_mark(f(X)) , Marked_active(f(mark(X)))>
<Marked_mark(f(X)) , Marked_f(mark(X))>
<Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(a) , Marked_active(a)>
<Marked_mark(c(X)) , Marked_active(c(X))>
<Marked_mark(g(X)) , Marked_active(g(mark(X)))>
<Marked_mark(g(X)) , Marked_g(mark(X))>
<Marked_mark(g(X)) , Marked_mark(X)>
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_f(active(X)) , Marked_f(X)>
<Marked_c(mark(X)) , Marked_c(X)>
<Marked_c(active(X)) , Marked_c(X)>
<Marked_g(mark(X)) , Marked_g(X)>
<Marked_g(active(X)) , Marked_g(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
<Marked_mark(f(X)) , Marked_active(f(mark(X)))>
<Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(c(X)) , Marked_active(c(X))>
<Marked_mark(g(X)) , Marked_active(g(mark(X)))>
<Marked_mark(g(X)) , Marked_mark(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 3*X0; 
 [ a ] () = 2; 
 [ f ] (X0) = 1; 
 [ Marked_active ] (X0) = 1*X0 + 1; 
 [ c ] (X0) = 0; 
 [ Marked_mark ] (X0) = 2; 
 [ active ] (X0) = 0; 
 [ g ] (X0) = 1; 
 removing <Marked_mark(c(X)),Marked_active(c(X))>
 [ {
      
     DP termination of:
     <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
<Marked_mark(f(X)) , Marked_active(f(mark(X)))>
<Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(g(X)) , Marked_active(g(mark(X)))>
<Marked_mark(g(X)) , Marked_mark(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
<Marked_mark(f(X)) , Marked_active(f(mark(X)))>
<Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(g(X)) , Marked_active(g(mark(X)))>
<Marked_mark(g(X)) , Marked_mark(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 2*X0; 
 [ a ] () = 1; 
 [ f ] (X0) = 2; 
 [ Marked_active ] (X0) = 1*X0; 
 [ c ] (X0) = 0; 
 [ Marked_mark ] (X0) = 2; 
 [ active ] (X0) = 0; 
 [ g ] (X0) = 0; 
 removing <Marked_mark(g(X)),Marked_active(g(mark(X)))>
 [ {
      
     DP termination of:
     <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
<Marked_mark(f(X)) , Marked_active(f(mark(X)))>
<Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(g(X)) , Marked_mark(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(f(f(a))) , Marked_mark(c(f(g(f(a)))))>
<Marked_mark(f(X)) , Marked_active(f(mark(X)))>
<Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(g(X)) , Marked_mark(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ a ] () = 1; 
 [ f ] (X0) = 1*X0; 
 [ Marked_active ] (X0) = 2*X0; 
 [ c ] (X0) = 0; 
 [ Marked_mark ] (X0) = 2*X0; 
 [ active ] (X0) = 1*X0; 
 [ g ] (X0) = 2*X0; 
 removing <Marked_active(f(f(a))),Marked_mark(c(f(g(f(a)))))>
 [ {
      
     DP termination of:
     <Marked_mark(f(X)) , Marked_active(f(mark(X)))>
<Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(g(X)) , Marked_mark(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(g(X)) , Marked_mark(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ a ] () = 0; 
 [ f ] (X0) = 1*X0; 
 [ c ] (X0) = 0; 
 [ Marked_mark ] (X0) = 3*X0; 
 [ active ] (X0) = 1*X0; 
 [ g ] (X0) = 1*X0 + 2; 
 removing <Marked_mark(g(X)),Marked_mark(X)>
 [ {
      
     DP termination of:
     <Marked_mark(f(X)) , Marked_mark(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_mark(f(X)) , Marked_mark(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2*X0 + 0; 
 [ a ] () = 2 + 0; 
 [ f ] (X0) = 1 + 1*X0 + 0; 
 [ c ] (X0) = 2*X0 + 0; 
 [ Marked_mark ] (X0) = 3*X0 + 0; 
 [ active ] (X0) = 1*X0 + 0; 
 [ g ] (X0) = 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_f(active(X)) , Marked_f(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 2*X0 + 1; 
 [ Marked_f ] (X0) = 3*X0; 
 [ a ] () = 2; 
 [ f ] (X0) = 1; 
 [ c ] (X0) = 0; 
 [ active ] (X0) = 1*X0; 
 [ g ] (X0) = 1*X0; 
 removing <Marked_f(mark(X)),Marked_f(X)>
 [ {
      
     DP termination of:
     <Marked_f(active(X)) , Marked_f(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_f(active(X)) , Marked_f(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 1 + 2*X0 + 0; 
 [ Marked_f ] (X0) = 3*X0 + 0; 
 [ a ] () = 0; 
 [ f ] (X0) = 0; 
 [ c ] (X0) = 2*X0 + 0; 
 [ active ] (X0) = 1 + 1*X0 + 0; 
 [ g ] (X0) = 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_c(mark(X)) , Marked_c(X)>
<Marked_c(active(X)) , Marked_c(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 3*X0 + 1; 
 [ a ] () = 3; 
 [ f ] (X0) = 1; 
 [ c ] (X0) = 0; 
 [ active ] (X0) = 1*X0; 
 [ g ] (X0) = 1*X0; 
 [ Marked_c ] (X0) = 3*X0; 
 removing <Marked_c(mark(X)),Marked_c(X)>
 [ {
      
     DP termination of:
     <Marked_c(active(X)) , Marked_c(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_c(active(X)) , Marked_c(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 1 + 2*X0 + 0; 
 [ a ] () = 2 + 0; 
 [ f ] (X0) = 0; 
 [ c ] (X0) = 2*X0 + 0; 
 [ active ] (X0) = 1 + 1*X0 + 0; 
 [ g ] (X0) = 0; 
 [ Marked_c ] (X0) = 3*X0 + 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_g(mark(X)) , Marked_g(X)>
<Marked_g(active(X)) , Marked_g(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 2*X0 + 2; 
 [ a ] () = 2; 
 [ f ] (X0) = 1*X0 + 3; 
 [ Marked_g ] (X0) = 3*X0; 
 [ c ] (X0) = 0; 
 [ active ] (X0) = 1*X0; 
 [ g ] (X0) = 0; 
 removing <Marked_g(mark(X)),Marked_g(X)>
 [ {
      
     DP termination of:
     <Marked_g(active(X)) , Marked_g(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_g(active(X)) , Marked_g(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 1 + 2*X0 + 0; 
 [ a ] () = 3 + 0; 
 [ f ] (X0) = 2 + 2*X0 + 0; 
 [ Marked_g ] (X0) = 3*X0 + 0; 
 [ c ] (X0) = 2 + 2*X0 + 0; 
 [ active ] (X0) = 1 + 1*X0 + 0; 
 [ g ] (X0) = 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 

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