WORST_CASE(?,O(n^1))
* Step 1: Bounds 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:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          Cons_0(2,2) -> 1
          Cons_0(2,2) -> 2
          Cons_1(2,2) -> 1
          Cons_1(2,2) -> 3
          Cons_1(2,3) -> 1
          Cons_1(2,3) -> 3
          Nil_0() -> 1
          Nil_0() -> 2
          Nil_1() -> 1
          Nil_1() -> 3
          main_0(2) -> 1
          walk#2_0(2,2) -> 1
          walk#2_1(2,3) -> 1
          2 -> 1
          3 -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak 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:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))