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(c) -> mark(f(g(c)))
  active(f(g(X))) -> mark(g(X))
  f(ok(X)) -> ok(f(X))
  g(ok(X)) -> ok(g(X))
  proper(c) -> ok(c)
  proper(f(X)) -> f(proper(X))
  proper(g(X)) -> g(proper(X))
  top(mark(X)) -> top(proper(X))
  top(ok(X)) -> top(active(X))
  
   the pairs 
  top#(mark(X)) -> top#(proper(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(c/0) = []
  pi(f/1) = []
  pi(g/1) = []
  
  RPO with the following precedence
  precedence(top#[1]) = 2
  precedence(mark[1]) = 3
  precedence(proper[1]) = 1
  precedence(c[0]) = 5
  precedence(f[1]) = 4
  precedence(g[1]) = 0
  
  precedence(_) = 0
  and the following status
  status(top#[1]) = lex
  status(mark[1]) = lex
  status(proper[1]) = lex
  status(c[0]) = lex
  status(f[1]) = lex
  status(g[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair top#(ok(X)) -> top#(active(X)) weakly:
  [(top#(ok(X)),0),(ok(X),0)] >=mu [(top#(active(X)),0),(active(X),0)] could not be ensured