WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            main(x1) -> walk#2(x1,Nil())
            walk#2(Cons(x12,x14),x16) -> walk#2(x14,Cons(x12,x16))
            walk#2(Nil(),x2) -> x2
        - Signature:
            {main/1,walk#2/2} / {Cons/2,Nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {main,walk#2} and constructors {Cons,Nil}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          Cons :: ["A"(0) x "A"(5)] -(5)-> "A"(5)
          Cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          Nil :: [] -(0)-> "A"(5)
          Nil :: [] -(0)-> "A"(12)
          main :: ["A"(15)] -(16)-> "A"(0)
          walk#2 :: ["A"(5) x "A"(0)] -(15)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "Cons_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          "Nil_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))