WORST_CASE(?,O(n^1))
* Step 1: Ara 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:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          * :: ["A"(0) x "A"(15)] -(1)-> "A"(0)
          + :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
          + :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "+_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
        

WORST_CASE(?,O(n^1))