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 {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
    + 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:
        --------------------------
          * :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          + :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          +_A :: [A(0) x A(0)] -(0)-> A(0)
        
* Step 2: Open MAYBE
    - Strict TRS:
        *(x,+(y,z)) -> +(*(x,y),*(x,z))
    - Signature:
        {*/2} / {+/2}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {*} and constructors {+}
Following problems could not be solved:
  - Strict TRS:
      *(x,+(y,z)) -> +(*(x,y),*(x,z))
  - Signature:
      {*/2} / {+/2}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {*} and constructors {+}
WORST_CASE(?,O(n^1))