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