WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            *(x,+(y,z)) -> +(*(x,y),*(x,z))
        - Signature:
            {*/2} / {+/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {*} and constructors {+}
    + 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(+) = {1,2}
        
        Following symbols are considered usable:
          {*}
        TcT has computed the following interpretation:
          p(*) = [2] x2 + [0]         
          p(+) = [1] x1 + [1] x2 + [9]
        
        Following rules are strictly oriented:
        *(x,+(y,z)) = [2] y + [2] z + [18]
                    > [2] y + [2] z + [9] 
                    = +(*(x,y),*(x,z))    
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))