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:
   
   f#(g(x, y)) -> f#(x)
   f#(g(x, y)) -> f#(y)
   rules:
   
   f(a) -> b
   f(c) -> d
   f(g(x, y)) -> g(f(x), f(y))
   f(h(x, y)) -> g(h(y, f(x)), h(x, f(y)))
   g(x, x) -> h(e, x)
   
    the pairs 
   f#(g(x, y)) -> f#(x)
   f#(g(x, y)) -> f#(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(f#) = [(epsilon,0),(1,0)]
   polynomial interpretration over naturals with negative constants
   Pol(f#(x_1)) = 1
   Pol(g(x_1, x_2)) = 1 + x_2 + x_1
   problem when orienting DPs
   cannot orient pair f#(g(x, y)) -> f#(x) strictly:
   [(f#(g(x, y)),0),(g(x, y),0)] >mu [(f#(x),0),(x,0)] could not be ensured