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