ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the dependency graph processor
 1.1.2: error when applying the reduction pair processor with usable rules to remove from the DP problem
  pairs:
  
  and#(mark(X1), X2) -> and#(X1, X2)
  and#(X1, mark(X2)) -> and#(X1, X2)
  and#(active(X1), X2) -> and#(X1, X2)
  and#(X1, active(X2)) -> and#(X1, X2)
  rules:
  
  active(and(tt, X)) -> mark(X)
  active(plus(N, 0)) -> mark(N)
  active(plus(N, s(M))) -> mark(s(plus(N, M)))
  and(mark(X1), X2) -> and(X1, X2)
  and(X1, mark(X2)) -> and(X1, X2)
  and(active(X1), X2) -> and(X1, X2)
  and(X1, active(X2)) -> and(X1, X2)
  mark(and(X1, X2)) -> active(and(mark(X1), X2))
  mark(tt) -> active(tt)
  mark(plus(X1, X2)) -> active(plus(mark(X1), mark(X2)))
  mark(0) -> active(0)
  mark(s(X)) -> active(s(mark(X)))
  plus(mark(X1), X2) -> plus(X1, X2)
  plus(X1, mark(X2)) -> plus(X1, X2)
  plus(active(X1), X2) -> plus(X1, X2)
  plus(X1, active(X2)) -> plus(X1, X2)
  s(mark(X)) -> s(X)
  s(active(X)) -> s(X)
  
   the pairs 
  and#(active(X1), X2) -> and#(X1, X2)
  
  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,1)]
  Argument Filter: 
  pi(and#/2) = []
  pi(mark/1) = 1
  pi(active/1) = [1]
  
  RPO with the following precedence
  precedence(and#[2]) = 0
  precedence(active[1]) = 1
  
  precedence(_) = 0
  and the following status
  status(and#[2]) = lex
  status(active[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair and#(mark(X1), X2) -> and#(X1, X2) weakly:
  [(and#(mark(X1), X2),0),(mark(X1),1)] >=mu [(and#(X1, X2),0),(X1,1)] could not be ensured