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