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), Y) -> ifMinus#(le(s(X), Y), s(X), Y)
  ifMinus#(false, s(X), Y) -> minus#(X, Y)
  rules:
  
  ifMinus(true, s(X), Y) -> 0
  ifMinus(false, s(X), Y) -> s(minus(X, Y))
  le(0, Y) -> true
  le(s(X), 0) -> false
  le(s(X), s(Y)) -> le(X, Y)
  minus(0, Y) -> 0
  minus(s(X), Y) -> ifMinus(le(s(X), Y), s(X), Y)
  quot(0, s(Y)) -> 0
  quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
  
   the pairs 
  minus#(s(X), Y) -> ifMinus#(le(s(X), Y), s(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(minus#) = [(epsilon,0),(2,0)]
  pi(ifMinus#) = [(2,0),(3,0)]
  Argument Filter: 
  pi(minus#/2) = [1]
  pi(s/1) = [1]
  pi(ifMinus#/3) = [1,3]
  pi(le/2) = 2
  pi(false/0) = []
  pi(0/0) = []
  pi(true/0) = []
  
  RPO with the following precedence
  precedence(minus#[2]) = 0
  precedence(s[1]) = 0
  precedence(ifMinus#[3]) = 1
  precedence(false[0]) = 2
  precedence(0[0]) = 2
  precedence(true[0]) = 0
  
  precedence(_) = 0
  and the following status
  status(minus#[2]) = mul
  status(s[1]) = mul
  status(ifMinus#[3]) = mul
  status(false[0]) = mul
  status(0[0]) = mul
  status(true[0]) = mul
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair ifMinus#(false, s(X), Y) -> minus#(X, Y) weakly:
  [(s(X),0),(Y,0)] >=mu [(minus#(X, Y),0),(Y,0)] could not be ensured