WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            sum(0()) -> 0()
            sum(s(x)) -> +(sum(x),s(x))
            sum1(0()) -> 0()
            sum1(s(x)) -> s(+(sum1(x),+(x,x)))
        - Signature:
            {sum/1,sum1/1} / {+/2,0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {sum,sum1} and constructors {+,0,s}
    + Applied Processor:
        Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          + :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          0 :: [] -(0)-> "A"(1)
          0 :: [] -(0)-> "A"(0)
          s :: ["A"(1)] -(1)-> "A"(1)
          s :: ["A"(0)] -(0)-> "A"(0)
          sum :: ["A"(1)] -(1)-> "A"(0)
          sum1 :: ["A"(1)] -(1)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "+_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          "0_A" :: [] -(0)-> "A"(0)
          "s_A" :: ["A"(0)] -(0)-> "A"(0)
        

WORST_CASE(?,O(n^1))