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