ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the dependency graph processor
 1.1.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
  pairs:
  
  top#(mark(X)) -> top#(proper(X))
  top#(ok(X)) -> top#(active(X))
  rules:
  
  active(f(X)) -> mark(g(h(f(X))))
  active(f(X)) -> f(active(X))
  active(h(X)) -> h(active(X))
  f(mark(X)) -> mark(f(X))
  f(ok(X)) -> ok(f(X))
  g(ok(X)) -> ok(g(X))
  h(mark(X)) -> mark(h(X))
  h(ok(X)) -> ok(h(X))
  proper(f(X)) -> f(proper(X))
  proper(g(X)) -> g(proper(X))
  proper(h(X)) -> h(proper(X))
  top(mark(X)) -> top(proper(X))
  top(ok(X)) -> top(active(X))
  
   the pairs 
  top#(ok(X)) -> top#(active(X))
  
  could not apply the generic root reduction pair processor with the following
  SCNP-version with mu = MS and the level mapping defined by 
  pi(top#) = [(epsilon,0),(1,0)]
  Argument Filter: 
  pi(top#/1) = []
  pi(ok/1) = [1]
  pi(active/1) = 1
  pi(mark/1) = 1
  pi(proper/1) = 1
  pi(f/1) = 1
  pi(g/1) = 1
  pi(h/1) = 1
  
  RPO with the following precedence
  precedence(ok[1]) = 0
  precedence(top#[1]) = 1
  
  precedence(_) = 0
  and the following status
  status(ok[1]) = lex
  status(top#[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair top#(mark(X)) -> top#(proper(X)) weakly:
  [(top#(mark(X)),0),(mark(X),0)] >=mu [(top#(proper(X)),0),(proper(X),0)] could not be ensured