WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            dbl(0(),y) -> y
            dbl(S(0()),S(0())) -> S(S(S(S(0()))))
            unsafe(0()) -> 0()
            unsafe(S(x)) -> dbl(unsafe(x),0())
        - Signature:
            {dbl/2,unsafe/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {dbl,unsafe} and constructors {0,S}
    + Applied Processor:
        Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> "A"(0)
          0 :: [] -(0)-> "A"(2)
          S :: ["A"(0)] -(0)-> "A"(0)
          S :: ["A"(2)] -(2)-> "A"(2)
          dbl :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
          unsafe :: ["A"(2)] -(1)-> "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))