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