WORST_CASE(?,O(n^1))
* Step 1: NaturalMI 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:
        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:
          none
        
        Following symbols are considered usable:
          {and}
        TcT has computed the following interpretation:
           p(and) = [8] x1 + [10] x2 + [8] x3 + [0]
          p(band) = [2]                            
           p(not) = [1] x1 + [1]                   
        
        Following rules are strictly oriented:
        and(not(not(x)),y,not(z)) = [8] x + [10] y + [8] z + [24]
                                  > [8] x + [8] y + [20]         
                                  = and(y,band(x,z),x)           
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))