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 below the reduction pair processor
  1.1.1.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
   pairs:
   
   not#(and(x, y)) -> not#(x)
   not#(and(x, y)) -> not#(y)
   rules:
   
   and(x, x) -> x
   not(not(x)) -> x
   not(and(x, y)) -> or(not(x), not(y))
   not(or(x, y)) -> and(not(x), not(y))
   or(x, x) -> x
   
    the pairs 
   not#(and(x, y)) -> not#(x)
   not#(and(x, y)) -> not#(y)
   
   could not apply the generic root reduction pair processor with the following
   SCNP-version with mu = MS and the level mapping defined by 
   pi(not#) = [(epsilon,0),(1,0)]
   polynomial interpretration over naturals with negative constants
   Pol(not#(x_1)) = 1
   Pol(and(x_1, x_2)) = 1 + x_2 + x_1
   problem when orienting DPs
   cannot orient pair not#(and(x, y)) -> not#(x) strictly:
   [(not#(and(x, y)),0),(and(x, y),0)] >mu [(not#(x),0),(x,0)] could not be ensured