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