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:
  
  +#(x, s(y)) -> +#(x, y)
  +#(s(x), y) -> +#(x, y)
  rules:
  
  +(x, 0) -> x
  +(x, s(y)) -> s(+(x, y))
  +(s(x), y) -> s(+(x, y))
  double(0) -> 0
  double(s(x)) -> s(s(double(x)))
  double(x) -> +(x, x)
  
   the pairs 
  +#(x, s(y)) -> +#(x, y)
  +#(s(x), y) -> +#(x, 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(+#) = [(epsilon,0),(2,3)]
  Argument Filter: 
  pi(+#/2) = 1
  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 +#(x, s(y)) -> +#(x, y) strictly:
  [(+#(x, s(y)),0),(s(y),3)] >mu [(+#(x, y),0),(y,3)] could not be ensured