WORST_CASE(?,O(n^1))
* Step 1: NaturalMI 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:
        NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation:
        The following argument positions are considered usable:
          uargs(sieve) = {1}
        
        Following symbols are considered usable:
          {filter,nats,sieve,zprimes}
        TcT has computed the following interpretation:
                p(0) = [2]                           
             p(cons) = [1] x1 + [0]                  
           p(filter) = [4] x1 + [1] x2 + [1] x3 + [4]
             p(nats) = [1] x1 + [1]                  
                p(s) = [0]                           
            p(sieve) = [8] x1 + [1]                  
          p(zprimes) = [10]                          
        
        Following rules are strictly oriented:
         filter(cons(X),0(),M) = [1] M + [4] X + [6]   
                               > [2]                   
                               = cons(0())             
        
        filter(cons(X),s(N),M) = [1] M + [4] X + [4]   
                               > [1] X + [0]           
                               = cons(X)               
        
                       nats(N) = [1] N + [1]           
                               > [1] N + [0]           
                               = cons(N)               
        
              sieve(cons(0())) = [17]                  
                               > [2]                   
                               = cons(0())             
        
             sieve(cons(s(N))) = [1]                   
                               > [0]                   
                               = cons(s(N))            
        
                     zprimes() = [10]                  
                               > [9]                   
                               = sieve(nats(s(s(0()))))
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))