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