WORST_CASE(?,O(n^1))
* Step 1: Bounds 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:
        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) -> 2
          Nil_0() -> 2
          comp_f_g_0(2,2) -> 2
          comp_f_g_1(1,3) -> 1
          cons1_x_0(2) -> 2
          cons1_x_1(2) -> 3
          id_0() -> 2
          id_1() -> 1
          main_0(2) -> 1
          walk#1_0(2) -> 1
          walk#1_1(2) -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak 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:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))