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 below the reduction pair processor
  1.1.1.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
   pairs:
   
   s#(f(x, y)) -> s#(y)
   s#(f(x, y)) -> s#(x)
   rules:
   
   f(x, a) -> x
   f(a, y) -> y
   f(g(x, y), g(u, v)) -> g(f(x, u), f(y, v))
   g(a, a) -> a
   s(a) -> a
   s(s(x)) -> x
   s(f(x, y)) -> f(s(y), s(x))
   s(g(x, y)) -> g(s(x), s(y))
   
    the pairs 
   s#(f(x, y)) -> s#(y)
   s#(f(x, y)) -> s#(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(s#) = [(epsilon,0),(1,0)]
   polynomial interpretration over naturals with negative constants
   Pol(s#(x_1)) = 1
   Pol(f(x_1, x_2)) = 1 + x_2 + x_1
   problem when orienting DPs
   cannot orient pair s#(f(x, y)) -> s#(y) strictly:
   [(s#(f(x, y)),0),(f(x, y),0)] >mu [(s#(y),0),(y,0)] could not be ensured