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 below the reduction pair processor
  1.1.2.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
   pairs:
   
   filter#(mark(X1), X2, X3) -> filter#(X1, X2, X3)
   filter#(X1, mark(X2), X3) -> filter#(X1, X2, X3)
   filter#(X1, X2, mark(X3)) -> filter#(X1, X2, X3)
   filter#(X1, active(X2), X3) -> filter#(X1, X2, X3)
   filter#(X1, X2, active(X3)) -> filter#(X1, X2, X3)
   rules:
   
   active(filter(cons(X, Y), 0, M)) -> mark(cons(0, filter(Y, M, M)))
   active(filter(cons(X, Y), s(N), M)) -> mark(cons(X, filter(Y, N, M)))
   active(sieve(cons(0, Y))) -> mark(cons(0, sieve(Y)))
   active(sieve(cons(s(N), Y))) -> mark(cons(s(N), sieve(filter(Y, N, N))))
   active(nats(N)) -> mark(cons(N, nats(s(N))))
   active(zprimes) -> mark(sieve(nats(s(s(0)))))
   cons(mark(X1), X2) -> cons(X1, X2)
   cons(X1, mark(X2)) -> cons(X1, X2)
   cons(active(X1), X2) -> cons(X1, X2)
   cons(X1, active(X2)) -> cons(X1, X2)
   filter(mark(X1), X2, X3) -> filter(X1, X2, X3)
   filter(X1, mark(X2), X3) -> filter(X1, X2, X3)
   filter(X1, X2, mark(X3)) -> filter(X1, X2, X3)
   filter(active(X1), X2, X3) -> filter(X1, X2, X3)
   filter(X1, active(X2), X3) -> filter(X1, X2, X3)
   filter(X1, X2, active(X3)) -> filter(X1, X2, X3)
   mark(filter(X1, X2, X3)) -> active(filter(mark(X1), mark(X2), mark(X3)))
   mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
   mark(0) -> active(0)
   mark(s(X)) -> active(s(mark(X)))
   mark(sieve(X)) -> active(sieve(mark(X)))
   mark(nats(X)) -> active(nats(mark(X)))
   mark(zprimes) -> active(zprimes)
   nats(mark(X)) -> nats(X)
   nats(active(X)) -> nats(X)
   s(mark(X)) -> s(X)
   s(active(X)) -> s(X)
   sieve(mark(X)) -> sieve(X)
   sieve(active(X)) -> sieve(X)
   
    the pairs 
   filter#(X1, active(X2), X3) -> filter#(X1, X2, X3)
   filter#(X1, X2, active(X3)) -> filter#(X1, X2, X3)
   
   could not apply the generic root reduction pair processor with the following
   SCNP-version with mu = MS and the level mapping defined by 
   pi(filter#) = [(2,2),(3,3)]
   polynomial interpretration over naturals with negative constants
   Pol(filter#(x_1, x_2, x_3)) = 0
   Pol(mark(x_1)) = x_1
   Pol(active(x_1)) = 1 + x_1
   problem when orienting DPs
   cannot orient pair filter#(X1, mark(X2), X3) -> filter#(X1, X2, X3) weakly:
   [(mark(X2),2),(X3,3)] >=mu [(X2,2),(X3,3)] could not be ensured