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:
  
  minus#(s(x), s(y)) -> minus#(x, y)
  minus#(minus(x, y), z) -> minus#(x, plus(y, z))
  rules:
  
  minus(x, 0) -> x
  minus(s(x), s(y)) -> minus(x, y)
  minus(minus(x, y), z) -> minus(x, plus(y, z))
  plus(0, y) -> y
  plus(s(x), y) -> s(plus(x, y))
  quot(0, s(y)) -> 0
  quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
  
   the pairs 
  minus#(minus(x, y), z) -> minus#(x, plus(y, z))
  
  could not apply the generic root reduction pair processor with the following
  SCNP-version with mu = MS and the level mapping defined by 
  pi(minus#) = [(1,1),(2,1)]
  Argument Filter: 
  pi(minus#/2) = []
  pi(minus/2) = [1,2]
  pi(plus/2) = 2
  pi(s/1) = 1
  pi(0/0) = []
  
  RPO with the following precedence
  precedence(minus#[2]) = 0
  precedence(minus[2]) = 1
  precedence(0[0]) = 2
  
  precedence(_) = 0
  and the following status
  status(minus#[2]) = lex
  status(minus[2]) = lex
  status(0[0]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair minus#(s(x), s(y)) -> minus#(x, y) weakly:
  [(s(x),1),(s(y),1)] >=mu [(x,1),(y,1)] could not be ensured