* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__f(X)) -> f(X)
            f(X) -> n__f(X)
            f(f(a())) -> f(g(n__f(a())))
        - Signature:
            {activate/1,f/1} / {a/0,g/1,n__f/1}
        - Obligation:
             runtime complexity wrt. defined symbols {activate,f} and constructors {a,g,n__f}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 2.
        The enriched problem is compatible with follwoing automaton.
          a_0() -> 1
          a_0() -> 2
          activate_0(1) -> 2
          activate_0(4) -> 2
          activate_0(5) -> 2
          f_0(1) -> 3
          f_0(4) -> 3
          f_0(5) -> 3
          f_1(1) -> 2
          f_1(4) -> 2
          f_1(5) -> 2
          g_0(1) -> 2
          g_0(1) -> 4
          g_0(4) -> 2
          g_0(4) -> 4
          g_0(5) -> 2
          g_0(5) -> 4
          n__f_0(1) -> 2
          n__f_0(1) -> 5
          n__f_0(4) -> 2
          n__f_0(4) -> 5
          n__f_0(5) -> 2
          n__f_0(5) -> 5
          n__f_1(1) -> 3
          n__f_1(4) -> 3
          n__f_1(5) -> 3
          n__f_2(1) -> 2
          n__f_2(4) -> 2
          n__f_2(5) -> 2
          1 -> 2
          4 -> 2
          5 -> 2
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            activate(X) -> X
            activate(n__f(X)) -> f(X)
            f(X) -> n__f(X)
            f(f(a())) -> f(g(n__f(a())))
        - Signature:
            {activate/1,f/1} / {a/0,g/1,n__f/1}
        - Obligation:
             runtime complexity wrt. defined symbols {activate,f} and constructors {a,g,n__f}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))