WORST_CASE(?,O(n^1))
* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            dbl(0(),y) -> y
            dbl(S(0()),S(0())) -> S(S(S(S(0()))))
            save(0()) -> 0()
            save(S(x)) -> dbl(0(),save(x))
        - Signature:
            {dbl/2,save/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {dbl,save} and constructors {0,S}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_0() -> 3
          0_1() -> 4
          0_1() -> 8
          0_1() -> 9
          S_0(1) -> 2
          S_0(1) -> 3
          S_0(2) -> 2
          S_0(2) -> 3
          S_1(5) -> 3
          S_1(6) -> 5
          S_1(7) -> 6
          S_1(8) -> 7
          dbl_0(1,1) -> 3
          dbl_0(1,2) -> 3
          dbl_0(2,1) -> 3
          dbl_0(2,2) -> 3
          dbl_1(8,9) -> 4
          dbl_1(9,9) -> 4
          dbl_1(9,9) -> 9
          save_0(1) -> 4
          save_0(2) -> 4
          save_1(1) -> 4
          save_1(1) -> 9
          save_1(2) -> 4
          save_1(2) -> 9
          1 -> 3
          2 -> 3
          9 -> 4
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            dbl(0(),y) -> y
            dbl(S(0()),S(0())) -> S(S(S(S(0()))))
            save(0()) -> 0()
            save(S(x)) -> dbl(0(),save(x))
        - Signature:
            {dbl/2,save/1} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {dbl,save} and constructors {0,S}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))