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) -> if_minus#(le(s(x), y), s(x), y)
  if_minus#(false, s(x), y) -> minus#(x, y)
  rules:
  
  if_minus(true, s(x), y) -> 0
  if_minus(false, s(x), y) -> s(minus(x, y))
  if_mod(true, s(x), s(y)) -> mod(minus(x, y), s(y))
  if_mod(false, s(x), s(y)) -> s(x)
  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) -> if_minus(le(s(x), y), s(x), y)
  mod(0, y) -> 0
  mod(s(x), 0) -> 0
  mod(s(x), s(y)) -> if_mod(le(y, x), s(x), s(y))
  
   the pairs 
  minus#(s(x), y) -> if_minus#(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(if_minus#) = [(2,0),(3,0)]
  Argument Filter: 
  pi(minus#/2) = [1]
  pi(s/1) = [1]
  pi(if_minus#/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(if_minus#[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(if_minus#[3]) = mul
  status(false[0]) = mul
  status(0[0]) = mul
  status(true[0]) = mul
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair if_minus#(false, s(x), y) -> minus#(x, y) weakly:
  [(s(x),0),(y,0)] >=mu [(minus#(x, y),0),(y,0)] could not be ensured