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