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

TRS termination of:
[1] active(f(f(X))) -> mark(c(f(g(f(X)))))
[2] active(c(X)) -> mark(d(X))
[3] active(h(X)) -> mark(c(d(X)))
[4] active(f(X)) -> f(active(X))
[5] active(h(X)) -> h(active(X))
[6] f(mark(X)) -> mark(f(X))
[7] h(mark(X)) -> mark(h(X))
[8] proper(f(X)) -> f(proper(X))
[9] proper(c(X)) -> c(proper(X))
[10] proper(g(X)) -> g(proper(X))
[11] proper(d(X)) -> d(proper(X))
[12] proper(h(X)) -> h(proper(X))
[13] f(ok(X)) -> ok(f(X))
[14] c(ok(X)) -> ok(c(X))
[15] g(ok(X)) -> ok(g(X))
[16] d(ok(X)) -> ok(d(X))
[17] h(ok(X)) -> ok(h(X))
[18] top(mark(X)) -> top(proper(X))
[19] top(ok(X)) -> top(active(X))


Sub problem: 
guided: 

DP termination of:
<Marked_active(f(f(X))) , Marked_c(f(g(f(X))))>
<Marked_active(f(f(X))) , Marked_f(g(f(X)))>
<Marked_active(f(f(X))) , Marked_g(f(X))>
<Marked_active(c(X)) , Marked_d(X)>
<Marked_active(h(X)) , Marked_c(d(X))>
<Marked_active(h(X)) , Marked_d(X)>
<Marked_active(f(X)) , Marked_f(active(X))>
<Marked_active(f(X)) , Marked_active(X)>
<Marked_active(h(X)) , Marked_h(active(X))>
<Marked_active(h(X)) , Marked_active(X)>
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_h(mark(X)) , Marked_h(X)>
<Marked_proper(f(X)) , Marked_f(proper(X))>
<Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(c(X)) , Marked_c(proper(X))>
<Marked_proper(c(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_g(proper(X))>
<Marked_proper(g(X)) , Marked_proper(X)>
<Marked_proper(d(X)) , Marked_d(proper(X))>
<Marked_proper(d(X)) , Marked_proper(X)>
<Marked_proper(h(X)) , Marked_h(proper(X))>
<Marked_proper(h(X)) , Marked_proper(X)>
<Marked_f(ok(X)) , Marked_f(X)>
<Marked_c(ok(X)) , Marked_c(X)>
<Marked_g(ok(X)) , Marked_g(X)>
<Marked_d(ok(X)) , Marked_d(X)>
<Marked_h(ok(X)) , Marked_h(X)>
<Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(mark(X)) , Marked_proper(X)>
<Marked_top(ok(X)) , Marked_top(active(X))>
<Marked_top(ok(X)) , Marked_active(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 8 components:

{  <Marked_top(ok(X)) , Marked_top(active(X))> 
      --> <Marked_top(ok(X)) , Marked_top(active(X))>
  <Marked_top(ok(X)) , Marked_top(active(X))> 
     --> <Marked_top(mark(X)) , Marked_top(proper(X))>
  <Marked_top(mark(X)) , Marked_top(proper(X))> 
     --> <Marked_top(ok(X)) , Marked_top(active(X))>
  <Marked_top(mark(X)) , Marked_top(proper(X))> 
     --> <Marked_top(mark(X)) , Marked_top(proper(X))>
}

{  <Marked_proper(h(X)) , Marked_proper(X)> 
      --> <Marked_proper(h(X)) , Marked_proper(X)>
  <Marked_proper(h(X)) , Marked_proper(X)> 
     --> <Marked_proper(d(X)) , Marked_proper(X)>
  <Marked_proper(h(X)) , Marked_proper(X)> 
     --> <Marked_proper(g(X)) , Marked_proper(X)>
  <Marked_proper(h(X)) , Marked_proper(X)> 
     --> <Marked_proper(c(X)) , Marked_proper(X)>
  <Marked_proper(h(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(d(X)) , Marked_proper(X)> 
     --> <Marked_proper(h(X)) , Marked_proper(X)>
  <Marked_proper(d(X)) , Marked_proper(X)> 
     --> <Marked_proper(d(X)) , Marked_proper(X)>
  <Marked_proper(d(X)) , Marked_proper(X)> 
     --> <Marked_proper(g(X)) , Marked_proper(X)>
  <Marked_proper(d(X)) , Marked_proper(X)> 
     --> <Marked_proper(c(X)) , Marked_proper(X)>
  <Marked_proper(d(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(g(X)) , Marked_proper(X)> 
     --> <Marked_proper(h(X)) , Marked_proper(X)>
  <Marked_proper(g(X)) , Marked_proper(X)> 
     --> <Marked_proper(d(X)) , Marked_proper(X)>
  <Marked_proper(g(X)) , Marked_proper(X)> 
     --> <Marked_proper(g(X)) , Marked_proper(X)>
  <Marked_proper(g(X)) , Marked_proper(X)> 
     --> <Marked_proper(c(X)) , Marked_proper(X)>
  <Marked_proper(g(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(c(X)) , Marked_proper(X)> 
     --> <Marked_proper(h(X)) , Marked_proper(X)>
  <Marked_proper(c(X)) , Marked_proper(X)> 
     --> <Marked_proper(d(X)) , Marked_proper(X)>
  <Marked_proper(c(X)) , Marked_proper(X)> 
     --> <Marked_proper(g(X)) , Marked_proper(X)>
  <Marked_proper(c(X)) , Marked_proper(X)> 
     --> <Marked_proper(c(X)) , Marked_proper(X)>
  <Marked_proper(c(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(h(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(d(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(g(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(c(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
}

{  <Marked_active(h(X)) , Marked_active(X)> 
      --> <Marked_active(h(X)) , Marked_active(X)>
  <Marked_active(h(X)) , Marked_active(X)> 
     --> <Marked_active(f(X)) , Marked_active(X)>
  <Marked_active(f(X)) , Marked_active(X)> 
     --> <Marked_active(h(X)) , Marked_active(X)>
  <Marked_active(f(X)) , Marked_active(X)> 
     --> <Marked_active(f(X)) , Marked_active(X)>
}

{  <Marked_g(ok(X)) , Marked_g(X)> --> <Marked_g(ok(X)) , Marked_g(X)>
}

{  <Marked_c(ok(X)) , Marked_c(X)> --> <Marked_c(ok(X)) , Marked_c(X)>
}

{  <Marked_d(ok(X)) , Marked_d(X)> --> <Marked_d(ok(X)) , Marked_d(X)>
}

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

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

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

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

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

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

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

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

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

{  <Marked_h(mark(X)) , Marked_h(X)> --> <Marked_h(mark(X)) , Marked_h(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  c(ok(X)) >= ok(c(X)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  g(ok(X)) >= ok(g(X)) ;
  active(c(X)) >= mark(d(X)) ;
  active(f(f(X))) >= mark(c(f(g(f(X))))) ;
  active(f(X)) >= f(active(X)) ;
  active(h(X)) >= mark(c(d(X))) ;
  active(h(X)) >= h(active(X)) ;
  d(ok(X)) >= ok(d(X)) ;
  h(mark(X)) >= mark(h(X)) ;
  h(ok(X)) >= ok(h(X)) ;
  proper(c(X)) >= c(proper(X)) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(g(X)) >= g(proper(X)) ;
  proper(d(X)) >= d(proper(X)) ;
  proper(h(X)) >= h(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_h(mark(X)) >= Marked_h(X) ;
 }
 + Disjunctions:{ 
{
  Marked_h(mark(X)) > Marked_h(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(ok(X)) >= ok(c(X))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: g(ok(X)) >= ok(g(X))
constraint: active(c(X)) >= mark(d(X))
constraint: active(f(f(X))) >= mark(c(f(g(f(X)))))
constraint: active(f(X)) >= f(active(X))
constraint: active(h(X)) >= mark(c(d(X)))
constraint: active(h(X)) >= h(active(X))
constraint: d(ok(X)) >= ok(d(X))
constraint: h(mark(X)) >= mark(h(X))
constraint: h(ok(X)) >= ok(h(X))
constraint: proper(c(X)) >= c(proper(X))
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(g(X)) >= g(proper(X))
constraint: proper(d(X)) >= d(proper(X))
constraint: proper(h(X)) >= h(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_h(mark(X)) >= Marked_h(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] active(f(f(X))) -> mark(c(f(g(f(X)))))
[2] active(c(X)) -> mark(d(X))
[3] active(h(X)) -> mark(c(d(X)))
[4] active(f(X)) -> f(active(X))
[5] active(h(X)) -> h(active(X))
[6] f(mark(X)) -> mark(f(X))
[7] h(mark(X)) -> mark(h(X))
[8] proper(f(X)) -> f(proper(X))
[9] proper(c(X)) -> c(proper(X))
[10] proper(g(X)) -> g(proper(X))
[11] proper(d(X)) -> d(proper(X))
[12] proper(h(X)) -> h(proper(X))
[13] f(ok(X)) -> ok(f(X))
[14] c(ok(X)) -> ok(c(X))
[15] g(ok(X)) -> ok(g(X))
[16] d(ok(X)) -> ok(d(X))
[17] h(ok(X)) -> ok(h(X))
[18] top(mark(X)) -> top(proper(X))
[19] top(ok(X)) -> top(active(X))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_active(f(f(X))) , Marked_c(f(g(f(X))))>
<Marked_active(f(f(X))) , Marked_f(g(f(X)))>
<Marked_active(f(f(X))) , Marked_g(f(X))>
<Marked_active(c(X)) , Marked_d(X)>
<Marked_active(h(X)) , Marked_c(d(X))>
<Marked_active(h(X)) , Marked_d(X)>
<Marked_active(f(X)) , Marked_f(active(X))>
<Marked_active(f(X)) , Marked_active(X)>
<Marked_active(h(X)) , Marked_h(active(X))>
<Marked_active(h(X)) , Marked_active(X)>
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_h(mark(X)) , Marked_h(X)>
<Marked_proper(f(X)) , Marked_f(proper(X))>
<Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(c(X)) , Marked_c(proper(X))>
<Marked_proper(c(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_g(proper(X))>
<Marked_proper(g(X)) , Marked_proper(X)>
<Marked_proper(d(X)) , Marked_d(proper(X))>
<Marked_proper(d(X)) , Marked_proper(X)>
<Marked_proper(h(X)) , Marked_h(proper(X))>
<Marked_proper(h(X)) , Marked_proper(X)>
<Marked_f(ok(X)) , Marked_f(X)>
<Marked_c(ok(X)) , Marked_c(X)>
<Marked_g(ok(X)) , Marked_g(X)>
<Marked_d(ok(X)) , Marked_d(X)>
<Marked_h(ok(X)) , Marked_h(X)>
<Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(mark(X)) , Marked_proper(X)>
<Marked_top(ok(X)) , Marked_top(active(X))>
<Marked_top(ok(X)) , Marked_active(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(ok(X)) , Marked_top(active(X))>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 1; 
 [ active ] (X0) = 0; 
 [ f ] (X0) = 2*X0; 
 [ Marked_top ] (X0) = 1*X0; 
 [ h ] (X0) = 1*X0; 
 [ c ] (X0) = 2*X0; 
 [ top ] (X0) = 0; 
 [ d ] (X0) = 1*X0; 
 [ g ] (X0) = 2*X0; 
 [ proper ] (X0) = 0; 
 removing <Marked_top(ok(X)),Marked_top(active(X))>
 [ {
      
     DP termination of:
     <Marked_top(mark(X)) , Marked_top(proper(X))>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(mark(X)) , Marked_top(proper(X))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 1*X0 + 0; 
 [ ok ] (X0) = 2 + 0; 
 [ active ] (X0) = 1 + 3*X0 + 0; 
 [ f ] (X0) = 1 + 2*X0 + 0; 
 [ Marked_top ] (X0) = 3*X0 + 0; 
 [ h ] (X0) = 1 + 1*X0 + 0; 
 [ c ] (X0) = 2 + 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ d ] (X0) = 1*X0 + 0; 
 [ g ] (X0) = 1*X0 + 0; 
 [ proper ] (X0) = 1*X0 + 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(c(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_proper(X)>
<Marked_proper(d(X)) , Marked_proper(X)>
<Marked_proper(h(X)) , Marked_proper(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ ok ] (X0) = 2*X0 + 3; 
 [ active ] (X0) = 1*X0; 
 [ Marked_proper ] (X0) = 3*X0; 
 [ f ] (X0) = 1*X0; 
 [ h ] (X0) = 2*X0 + 1; 
 [ c ] (X0) = 1*X0; 
 [ top ] (X0) = 2*X0; 
 [ d ] (X0) = 1*X0; 
 [ g ] (X0) = 1*X0; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_proper(h(X)),Marked_proper(X)>
 [ {
      
     DP termination of:
     <Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(c(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_proper(X)>
<Marked_proper(d(X)) , Marked_proper(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(c(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_proper(X)>
<Marked_proper(d(X)) , Marked_proper(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ ok ] (X0) = 3*X0 + 3; 
 [ active ] (X0) = 1*X0; 
 [ Marked_proper ] (X0) = 3*X0; 
 [ f ] (X0) = 2*X0 + 1; 
 [ h ] (X0) = 2*X0; 
 [ c ] (X0) = 1*X0; 
 [ top ] (X0) = 2*X0; 
 [ d ] (X0) = 1*X0; 
 [ g ] (X0) = 1*X0; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_proper(f(X)),Marked_proper(X)>
 [ {
      
     DP termination of:
     <Marked_proper(c(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_proper(X)>
<Marked_proper(d(X)) , Marked_proper(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_proper(c(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_proper(X)>
<Marked_proper(d(X)) , Marked_proper(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ active ] (X0) = 0; 
 [ Marked_proper ] (X0) = 3*X0; 
 [ f ] (X0) = 0; 
 [ h ] (X0) = 0; 
 [ c ] (X0) = 1*X0; 
 [ top ] (X0) = 0; 
 [ d ] (X0) = 2*X0 + 1; 
 [ g ] (X0) = 1*X0; 
 [ proper ] (X0) = 2*X0; 
 removing <Marked_proper(d(X)),Marked_proper(X)>
 [ {
      
     DP termination of:
     <Marked_proper(c(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_proper(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_proper(c(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_proper(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ active ] (X0) = 0; 
 [ Marked_proper ] (X0) = 3*X0; 
 [ f ] (X0) = 0; 
 [ h ] (X0) = 0; 
 [ c ] (X0) = 1*X0; 
 [ top ] (X0) = 0; 
 [ d ] (X0) = 0; 
 [ g ] (X0) = 1*X0 + 2; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_proper(g(X)),Marked_proper(X)>
 [ {
      
     DP termination of:
     <Marked_proper(c(X)) , Marked_proper(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_proper(c(X)) , Marked_proper(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 0; 
 [ ok ] (X0) = 2 + 2*X0 + 0; 
 [ active ] (X0) = 2*X0 + 0; 
 [ Marked_proper ] (X0) = 3*X0 + 0; 
 [ f ] (X0) = 2 + 2*X0 + 0; 
 [ h ] (X0) = 2 + 2*X0 + 0; 
 [ c ] (X0) = 2 + 3*X0 + 0; 
 [ top ] (X0) = 0; 
 [ d ] (X0) = 1 + 2*X0 + 0; 
 [ g ] (X0) = 1*X0 + 0; 
 [ proper ] (X0) = 2*X0 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_active(f(X)) , Marked_active(X)>
<Marked_active(h(X)) , Marked_active(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ ok ] (X0) = 2*X0 + 3; 
 [ active ] (X0) = 1*X0; 
 [ f ] (X0) = 2*X0; 
 [ h ] (X0) = 2*X0 + 2; 
 [ c ] (X0) = 1*X0; 
 [ top ] (X0) = 2*X0; 
 [ d ] (X0) = 1*X0; 
 [ g ] (X0) = 1*X0; 
 [ Marked_active ] (X0) = 3*X0; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_active(h(X)),Marked_active(X)>
 [ {
      
     DP termination of:
     <Marked_active(f(X)) , Marked_active(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(f(X)) , Marked_active(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 0; 
 [ ok ] (X0) = 0; 
 [ active ] (X0) = 2 + 3*X0 + 0; 
 [ f ] (X0) = 2 + 2*X0 + 0; 
 [ h ] (X0) = 2 + 0; 
 [ c ] (X0) = 2 + 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ d ] (X0) = 2 + 0; 
 [ g ] (X0) = 0; 
 [ Marked_active ] (X0) = 3*X0 + 0; 
 [ proper ] (X0) = 1*X0 + 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_g(ok(X)) , Marked_g(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 0; 
 [ ok ] (X0) = 2 + 2*X0 + 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ f ] (X0) = 2 + 3*X0 + 0; 
 [ h ] (X0) = 2 + 2*X0 + 0; 
 [ c ] (X0) = 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ d ] (X0) = 2*X0 + 0; 
 [ g ] (X0) = 2*X0 + 0; 
 [ proper ] (X0) = 2*X0 + 0; 
 [ Marked_g ] (X0) = 3*X0 + 0; 
 ]} 
{
 
DP termination of:
<Marked_c(ok(X)) , Marked_c(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 0; 
 [ Marked_c ] (X0) = 3*X0 + 0; 
 [ ok ] (X0) = 2 + 2*X0 + 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ f ] (X0) = 2 + 3*X0 + 0; 
 [ h ] (X0) = 2*X0 + 0; 
 [ c ] (X0) = 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ d ] (X0) = 1*X0 + 0; 
 [ g ] (X0) = 2*X0 + 0; 
 [ proper ] (X0) = 1*X0 + 0; 
 ]} 
{
 
DP termination of:
<Marked_d(ok(X)) , Marked_d(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 3 + 1*X0 + 0; 
 [ ok ] (X0) = 2 + 2*X0 + 0; 
 [ active ] (X0) = 3 + 3*X0 + 0; 
 [ f ] (X0) = 2 + 2*X0 + 0; 
 [ h ] (X0) = 2 + 2*X0 + 0; 
 [ Marked_d ] (X0) = 3*X0 + 0; 
 [ c ] (X0) = 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ d ] (X0) = 2*X0 + 0; 
 [ g ] (X0) = 1*X0 + 0; 
 [ proper ] (X0) = 1*X0 + 0; 
 ]} 
{
 
DP termination of:
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_f(ok(X)) , Marked_f(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ ok ] (X0) = 2*X0 + 3; 
 [ active ] (X0) = 1*X0; 
 [ f ] (X0) = 1*X0; 
 [ h ] (X0) = 2*X0; 
 [ c ] (X0) = 1*X0; 
 [ Marked_f ] (X0) = 3*X0; 
 [ top ] (X0) = 2*X0; 
 [ d ] (X0) = 1*X0; 
 [ g ] (X0) = 1*X0; 
 [ proper ] (X0) = 0; 
 removing <Marked_f(ok(X)),Marked_f(X)>
 [ {
      
     DP termination of:
     <Marked_f(mark(X)) , Marked_f(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_f(mark(X)) , Marked_f(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 1*X0 + 0; 
 [ ok ] (X0) = 2 + 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ f ] (X0) = 2 + 2*X0 + 0; 
 [ h ] (X0) = 2 + 3*X0 + 0; 
 [ c ] (X0) = 2 + 2*X0 + 0; 
 [ Marked_f ] (X0) = 3*X0 + 0; 
 [ top ] (X0) = 0; 
 [ d ] (X0) = 2*X0 + 0; 
 [ g ] (X0) = 2 + 0; 
 [ proper ] (X0) = 2*X0 + 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_h(mark(X)) , Marked_h(X)>
<Marked_h(ok(X)) , Marked_h(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ ok ] (X0) = 2*X0 + 3; 
 [ active ] (X0) = 1*X0; 
 [ f ] (X0) = 1*X0; 
 [ h ] (X0) = 3*X0; 
 [ c ] (X0) = 1*X0; 
 [ top ] (X0) = 2*X0; 
 [ d ] (X0) = 1*X0; 
 [ Marked_h ] (X0) = 3*X0; 
 [ g ] (X0) = 1*X0; 
 [ proper ] (X0) = 0; 
 removing <Marked_h(ok(X)),Marked_h(X)>
 [ {
      
     DP termination of:
     <Marked_h(mark(X)) , Marked_h(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_h(mark(X)) , Marked_h(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 1*X0 + 0; 
 [ ok ] (X0) = 2 + 0; 
 [ active ] (X0) = 2 + 3*X0 + 0; 
 [ f ] (X0) = 1 + 2*X0 + 0; 
 [ h ] (X0) = 1 + 2*X0 + 0; 
 [ c ] (X0) = 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ d ] (X0) = 2*X0 + 0; 
 [ Marked_h ] (X0) = 3*X0 + 0; 
 [ g ] (X0) = 1*X0 + 0; 
 [ proper ] (X0) = 2*X0 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 

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