WORST_CASE(?,O(n^1))
* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            active(f(X)) -> f(active(X))
            active(f(X)) -> mark(g(h(f(X))))
            active(h(X)) -> h(active(X))
            f(mark(X)) -> mark(f(X))
            f(ok(X)) -> ok(f(X))
            g(ok(X)) -> ok(g(X))
            h(mark(X)) -> mark(h(X))
            h(ok(X)) -> ok(h(X))
            proper(f(X)) -> f(proper(X))
            proper(g(X)) -> g(proper(X))
            proper(h(X)) -> h(proper(X))
            top(mark(X)) -> top(proper(X))
            top(ok(X)) -> top(active(X))
        - Signature:
            {active/1,f/1,g/1,h/1,proper/1,top/1} / {mark/1,ok/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {active,f,g,h,proper,top} and constructors {mark,ok}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          active_0(5) -> 1
          active_0(6) -> 1
          active_1(5) -> 12
          active_1(6) -> 12
          f_0(5) -> 2
          f_0(6) -> 2
          f_1(5) -> 9
          f_1(6) -> 9
          g_0(5) -> 3
          g_0(6) -> 3
          g_1(5) -> 10
          g_1(6) -> 10
          h_0(5) -> 4
          h_0(6) -> 4
          h_1(5) -> 11
          h_1(6) -> 11
          mark_0(5) -> 5
          mark_0(6) -> 5
          mark_1(9) -> 2
          mark_1(9) -> 9
          mark_1(11) -> 4
          mark_1(11) -> 11
          ok_0(5) -> 6
          ok_0(6) -> 6
          ok_1(9) -> 2
          ok_1(9) -> 9
          ok_1(10) -> 3
          ok_1(10) -> 10
          ok_1(11) -> 4
          ok_1(11) -> 11
          proper_0(5) -> 7
          proper_0(6) -> 7
          proper_1(5) -> 12
          proper_1(6) -> 12
          top_0(5) -> 8
          top_0(6) -> 8
          top_1(12) -> 8
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            active(f(X)) -> f(active(X))
            active(f(X)) -> mark(g(h(f(X))))
            active(h(X)) -> h(active(X))
            f(mark(X)) -> mark(f(X))
            f(ok(X)) -> ok(f(X))
            g(ok(X)) -> ok(g(X))
            h(mark(X)) -> mark(h(X))
            h(ok(X)) -> ok(h(X))
            proper(f(X)) -> f(proper(X))
            proper(g(X)) -> g(proper(X))
            proper(h(X)) -> h(proper(X))
            top(mark(X)) -> top(proper(X))
            top(ok(X)) -> top(active(X))
        - Signature:
            {active/1,f/1,g/1,h/1,proper/1,top/1} / {mark/1,ok/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {active,f,g,h,proper,top} and constructors {mark,ok}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))