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