ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the dependency graph processor
 1.1.3: error when applying the reduction pair processor with usable rules to remove from the DP problem
  pairs:
  
  proper#(f(X)) -> proper#(X)
  proper#(g(X)) -> proper#(X)
  proper#(h(X)) -> proper#(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 
  proper#(f(X)) -> 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(proper#) = [(epsilon,0),(1,0)]
  Argument Filter: 
  pi(proper#/1) = []
  pi(g/1) = 1
  pi(f/1) = [1]
  pi(h/1) = 1
  
  RPO with the following precedence
  precedence(proper#[1]) = 0
  precedence(f[1]) = 1
  
  precedence(_) = 0
  and the following status
  status(proper#[1]) = lex
  status(f[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair proper#(g(X)) -> proper#(X) weakly:
  [(proper#(g(X)),0),(g(X),0)] >=mu [(proper#(X),0),(X,0)] could not be ensured