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:
  
  and#(x, or(y, z)) -> and#(x, y)
  and#(x, or(y, z)) -> and#(x, z)
  and#(x, and(y, y)) -> and#(x, y)
  rules:
  
  and(x, or(y, z)) -> or(and(x, y), and(x, z))
  and(x, and(y, y)) -> and(x, y)
  and(x, true) -> x
  and(false, y) -> false
  and(x, x) -> x
  or(or(x, y), and(y, z)) -> or(x, y)
  or(x, and(x, y)) -> x
  or(true, y) -> true
  or(x, false) -> x
  or(x, x) -> x
  or(x, or(y, y)) -> or(x, y)
  
   the pairs 
  and#(x, or(y, z)) -> and#(x, y)
  and#(x, or(y, z)) -> 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#) = [(1,3),(2,2)]
  Argument Filter: 
  pi(and#/2) = 2
  pi(or/2) = [1,2]
  pi(and/2) = 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#(x, and(y, y)) -> and#(x, y) weakly:
  [(x,3),(and(y, y),2)] >=mu [(x,3),(y,2)] could not be ensured