WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            filter(cons(X),0(),M) -> cons(0())
            filter(cons(X),s(N),M) -> cons(X)
            nats(N) -> cons(N)
            sieve(cons(0())) -> cons(0())
            sieve(cons(s(N))) -> cons(s(N))
            zprimes() -> sieve(nats(s(s(0()))))
        - Signature:
            {filter/3,nats/1,sieve/1,zprimes/0} / {0/0,cons/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {filter,nats,sieve,zprimes} and constructors {0,cons,s}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> A(8)
          0 :: [] -(0)-> A(0)
          0 :: [] -(0)-> A(12)
          0 :: [] -(0)-> A(1)
          0 :: [] -(0)-> A(3)
          cons :: [A(1)] -(0)-> A(1)
          cons :: [A(0)] -(0)-> A(0)
          cons :: [A(4)] -(0)-> A(4)
          filter :: [A(1) x A(8) x A(0)] -(8)-> A(1)
          nats :: [A(0)] -(1)-> A(0)
          s :: [A(8)] -(8)-> A(8)
          s :: [A(0)] -(0)-> A(0)
          s :: [A(1)] -(1)-> A(1)
          sieve :: [A(0)] -(1)-> A(0)
          zprimes :: [] -(8)-> A(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          0_A :: [] -(0)-> A(1)
          cons_A :: [A(1)] -(0)-> A(1)
          s_A :: [A(1)] -(1)-> A(1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        filter(cons(X),0(),M) -> cons(0())
        filter(cons(X),s(N),M) -> cons(X)
        nats(N) -> cons(N)
        sieve(cons(0())) -> cons(0())
        sieve(cons(s(N))) -> cons(s(N))
        zprimes() -> sieve(nats(s(s(0()))))
    - Signature:
        {filter/3,nats/1,sieve/1,zprimes/0} / {0/0,cons/1,s/1}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {filter,nats,sieve,zprimes} and constructors {0,cons,s}
Following problems could not be solved:
  - Strict TRS:
      filter(cons(X),0(),M) -> cons(0())
      filter(cons(X),s(N),M) -> cons(X)
      nats(N) -> cons(N)
      sieve(cons(0())) -> cons(0())
      sieve(cons(s(N))) -> cons(s(N))
      zprimes() -> sieve(nats(s(s(0()))))
  - Signature:
      {filter/3,nats/1,sieve/1,zprimes/0} / {0/0,cons/1,s/1}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {filter,nats,sieve,zprimes} and constructors {0,cons,s}
WORST_CASE(?,O(n^1))