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#(c(s(x), y)) -> f#(c(x, s(y)))
  rules:
  
  f(c(s(x), y)) -> f(c(x, s(y)))
  g(c(x, s(y))) -> g(c(s(x), y))
  g(s(f(x))) -> g(f(x))
  
   the pairs 
  f#(c(s(x), y)) -> f#(c(x, s(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)]
  Argument Filter: 
  pi(f#/1) = []
  pi(c/2) = 1
  pi(s/1) = [1]
  
  RPO with the following precedence
  precedence(s[1]) = 0
  precedence(f#[1]) = 1
  
  precedence(_) = 0
  and the following status
  status(s[1]) = lex
  status(f#[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair f#(c(s(x), y)) -> f#(c(x, s(y))) strictly:
  [(f#(c(s(x), y)),0),(c(s(x), y),0)] >mu [(f#(c(x, s(y))),0),(c(x, s(y)),0)] could not be ensured