WORST_CASE(?,O(n^1))
* Step 1: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            and(not(not(x)),y,not(z)) -> and(y,band(x,z),x)
        - Signature:
            {and/3} / {band/2,not/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {and} and constructors {band,not}
    + Applied Processor:
        NaturalPI {shape = Linear, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(linear):
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {and}
        TcT has computed the following interpretation:
           p(and) = x1 + 2*x2
          p(band) = 8        
           p(not) = 10 + x1  
        
        Following rules are strictly oriented:
        and(not(not(x)),y,not(z)) = 20 + x + 2*y      
                                  > 16 + y            
                                  = and(y,band(x,z),x)
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))