MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          a__filter(X1,X2,X3) -> filter(X1,X2,X3)
          a__filter(cons(X,Y),0(),M) -> cons(0(),filter(Y,M,M))
          a__filter(cons(X,Y),s(N),M) -> cons(mark(X),filter(Y,N,M))
          a__nats(N) -> cons(mark(N),nats(s(N)))
          a__nats(X) -> nats(X)
          a__sieve(X) -> sieve(X)
          a__sieve(cons(0(),Y)) -> cons(0(),sieve(Y))
          a__sieve(cons(s(N),Y)) -> cons(s(mark(N)),sieve(filter(Y,N,N)))
          a__zprimes() -> a__sieve(a__nats(s(s(0()))))
          a__zprimes() -> zprimes()
          mark(0()) -> 0()
          mark(cons(X1,X2)) -> cons(mark(X1),X2)
          mark(filter(X1,X2,X3)) -> a__filter(mark(X1),mark(X2),mark(X3))
          mark(nats(X)) -> a__nats(mark(X))
          mark(s(X)) -> s(mark(X))
          mark(sieve(X)) -> a__sieve(mark(X))
          mark(zprimes()) -> a__zprimes()
      - Signature:
          {a__filter/3,a__nats/1,a__sieve/1,a__zprimes/0,mark/1} / {0/0,cons/2,filter/3,nats/1,s/1,sieve/1,zprimes/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {a__filter,a__nats,a__sieve,a__zprimes
          ,mark} and constructors {0,cons,filter,nats,s,sieve,zprimes}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
  + Details:
      The input can not be schown compatible.
MAYBE