* 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())) -> c(n__f(g(f(a()))))
        - Signature:
            {activate/1,f/1} / {a/0,c/1,g/1,n__f/1}
        - Obligation:
             runtime complexity wrt. defined symbols {activate,f} and constructors {a,c,g,n__f}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, 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(2) -> 1
          c_0(2) -> 1
          c_0(2) -> 2
          f_0(2) -> 1
          f_1(2) -> 1
          g_0(2) -> 1
          g_0(2) -> 2
          n__f_0(2) -> 1
          n__f_0(2) -> 2
          n__f_1(2) -> 1
          n__f_2(2) -> 1
          2 -> 1
* 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())) -> c(n__f(g(f(a()))))
        - Signature:
            {activate/1,f/1} / {a/0,c/1,g/1,n__f/1}
        - Obligation:
             runtime complexity wrt. defined symbols {activate,f} and constructors {a,c,g,n__f}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))