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:
  
  implies#(not(x), not(y)) -> implies#(y, and(x, y))
  rules:
  
  and(x, false) -> false
  and(x, not(false)) -> x
  implies(false, y) -> not(false)
  implies(x, false) -> not(x)
  implies(not(x), not(y)) -> implies(y, and(x, y))
  not(not(x)) -> x
  
   the pairs 
  implies#(not(x), not(y)) -> implies#(y, and(x, y))
  
  could not apply the generic root reduction pair processor with the following
  SCNP-version with mu = MAX and the level mapping defined by 
  pi(implies#) = [(epsilon,0)]
  Argument Filter: 
  pi(implies#/2) = [1,2]
  pi(not/1) = [1]
  pi(and/2) = [1]
  pi(false/0) = []
  
  RPO with the following precedence
  precedence(implies#[2]) = 0
  precedence(not[1]) = 0
  precedence(and[2]) = 0
  precedence(false[0]) = 0
  
  precedence(_) = 0
  and the following status
  status(implies#[2]) = mul
  status(not[1]) = mul
  status(and[2]) = mul
  status(false[0]) = mul
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair implies#(not(x), not(y)) -> implies#(y, and(x, y)) strictly:
  [(implies#(not(x), not(y)),0)] >mu [(implies#(y, and(x, y)),0)] could not be ensured