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