WORST_CASE(?,O(n^1))
* Step 1: NaturalPI 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:
        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:
          uargs(+) = {1,2}
        
        Following symbols are considered usable:
          {*}
        TcT has computed the following interpretation:
          p(*) = 7 + 8*x2   
          p(+) = 3 + x1 + x2
        
        Following rules are strictly oriented:
        *(x,+(y,z)) = 31 + 8*y + 8*z  
                    > 17 + 8*y + 8*z  
                    = +(*(x,y),*(x,z))
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))