ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the reduction pair processor
 1.1.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
  pairs:
  
  p#(m, n, s(r)) -> p#(m, r, n)
  rules:
  
  p(m, n, s(r)) -> p(m, r, n)
  p(m, s(n), 0) -> p(0, n, m)
  p(m, 0, 0) -> m
  
   the pairs 
  p#(m, n, s(r)) -> p#(m, r, n)
  
  could not apply the generic root reduction pair processor with the following
  SCNP-version with mu = MS and the level mapping defined by 
  pi(p#) = [(epsilon,0),(2,0)]
  Argument Filter: 
  pi(p#/3) = 3
  pi(s/1) = [1]
  
  RPO with the following precedence
  precedence(s[1]) = 0
  
  precedence(_) = 0
  and the following status
  status(s[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair p#(m, n, s(r)) -> p#(m, r, n) strictly:
  [(p#(m, n, s(r)),0),(n,0)] >mu [(p#(m, r, n),0),(r,0)] could not be ensured