WORST_CASE(?,O(1))
* Step 1: Ara WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            main(0()) -> 0()
            main(S(x4)) -> x4
        - Signature:
            {main/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {main} and constructors {0,S}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> "A"(0)
          S :: ["A"(0)] -(0)-> "A"(0)
          main :: ["A"(0)] -(15)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "0_A" :: [] -(0)-> "A"(1)
          "S_A" :: ["A"(0)] -(0)-> "A"(1)
        

WORST_CASE(?,O(1))