WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            div2(0()) -> 0()
            div2(S(0())) -> 0()
            div2(S(S(x))) -> +(S(0()),div2(x))
        - Weak TRS:
            +(x,S(0())) -> S(x)
            +(S(0()),y) -> S(y)
        - Signature:
            {+/2,div2/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+,div2} 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)
          div2 :: ["A"(1)] -(2)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "0_A" :: [] -(0)-> "A"(0)
          "S_A" :: ["A"(0)] -(0)-> "A"(0)
        

WORST_CASE(?,O(n^1))