WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            main(x20) -> walk#1(x20)
            walk#1(Cons(x4,x7)) -> comp_f_g(walk#1(x7),cons1_x(x4))
            walk#1(Nil()) -> id()
        - Signature:
            {main/1,walk#1/1} / {Cons/2,Nil/0,comp_f_g/2,cons1_x/1,id/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {main,walk#1} and constructors {Cons,Nil,comp_f_g,cons1_x
            ,id}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          Cons :: ["A"(0) x "A"(11)] -(11)-> "A"(11)
          Nil :: [] -(0)-> "A"(11)
          comp_f_g :: ["A"(0) x "A"(0)] -(0)-> "A"(14)
          cons1_x :: ["A"(0)] -(0)-> "A"(14)
          id :: [] -(0)-> "A"(8)
          main :: ["A"(15)] -(9)-> "A"(0)
          walk#1 :: ["A"(11)] -(4)-> "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)
          "comp_f_g_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
          "cons1_x_A" :: ["A"(0)] -(0)-> "A"(1)
          "id_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))