ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the dependency graph processor
 1.1.2: error when applying the reduction pair processor with usable rules to remove from the DP problem
  pairs:
  
  f#(s(X), X) -> f#(X, a(X))
  rules:
  
  f(s(X), X) -> f(X, a(X))
  f(X, c(X)) -> f(s(X), X)
  f(X, X) -> c(X)
  
   the pairs 
  f#(s(X), X) -> f#(X, 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),(2,0)]
  Argument Filter: 
  pi(f#/2) = 1
  pi(s/1) = []
  pi(a/1) = []
  
  RPO with the following precedence
  precedence(s[1]) = 1
  precedence(a[1]) = 0
  
  precedence(_) = 0
  and the following status
  status(s[1]) = lex
  status(a[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair f#(s(X), X) -> f#(X, a(X)) strictly:
  [(f#(s(X), X),0),(X,0)] >mu [(f#(X, a(X)),0),(a(X),0)] could not be ensured