ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
 pairs:
 
 quot#(s(x), s(y), z) -> quot#(x, y, z)
 quot#(x, 0, s(z)) -> quot#(x, s(z), s(z))
 rules:
 
 quot(0, s(y), s(z)) -> 0
 quot(s(x), s(y), z) -> quot(x, y, z)
 quot(x, 0, s(z)) -> s(quot(x, s(z), s(z)))
 
  the pairs 
 quot#(s(x), s(y), z) -> quot#(x, 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(quot#) = [(epsilon,0),(3,0)]
 Argument Filter: 
 pi(quot#/3) = 1
 pi(s/1) = [1]
 pi(0/0) = []
 
 RPO with the following precedence
 precedence(s[1]) = 0
 precedence(0[0]) = 1
 
 precedence(_) = 0
 and the following status
 status(s[1]) = lex
 status(0[0]) = lex
 
 status(_) = lex
 
 problem when orienting DPs
 cannot orient pair quot#(x, 0, s(z)) -> quot#(x, s(z), s(z)) weakly:
 [(quot#(x, 0, s(z)),0),(s(z),0)] >=mu [(quot#(x, s(z), s(z)),0),(s(z),0)] could not be ensured