ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
 pairs:
 
 and#(not(not(x)), y, not(z)) -> and#(y, band(x, z), x)
 rules:
 
 and(not(not(x)), y, not(z)) -> and(y, band(x, z), x)
 
  the pairs 
 and#(not(not(x)), y, not(z)) -> and#(y, band(x, z), x)
 
 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#/3) = 2
 pi(not/1) = [1]
 pi(band/2) = [1]
 
 RPO with the following precedence
 precedence(not[1]) = 0
 precedence(band[2]) = 0
 
 precedence(_) = 0
 and the following status
 status(not[1]) = lex
 status(band[2]) = lex
 
 status(_) = lex
 
 problem when orienting DPs
 cannot orient pair and#(not(not(x)), y, not(z)) -> and#(y, band(x, z), x) strictly:
 [(and#(not(not(x)), y, not(z)),0),(not(not(x)),0)] >mu [(and#(y, band(x, z), x),0),(y,0)] could not be ensured