WORST_CASE(?,O(n^1))
* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a__f(X) -> f(X)
            a__f(f(a())) -> c(f(g(f(a()))))
            mark(a()) -> a()
            mark(c(X)) -> c(X)
            mark(f(X)) -> a__f(mark(X))
            mark(g(X)) -> g(mark(X))
        - Signature:
            {a__f/1,mark/1} / {a/0,c/1,f/1,g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a__f,mark} and constructors {a,c,f,g}
    + 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_1() -> 6
          a_1() -> 10
          a_1() -> 11
          a_2() -> 15
          a__f_0(1) -> 2
          a__f_0(3) -> 2
          a__f_0(4) -> 2
          a__f_0(5) -> 2
          a__f_1(11) -> 6
          a__f_1(11) -> 11
          c_0(1) -> 3
          c_0(3) -> 3
          c_0(4) -> 3
          c_0(5) -> 3
          c_1(1) -> 6
          c_1(1) -> 11
          c_1(3) -> 6
          c_1(3) -> 11
          c_1(4) -> 6
          c_1(4) -> 11
          c_1(5) -> 6
          c_1(5) -> 11
          c_1(7) -> 2
          c_2(12) -> 6
          c_2(12) -> 11
          f_0(1) -> 4
          f_0(3) -> 4
          f_0(4) -> 4
          f_0(5) -> 4
          f_1(1) -> 2
          f_1(3) -> 2
          f_1(4) -> 2
          f_1(5) -> 2
          f_1(8) -> 7
          f_1(10) -> 9
          f_2(11) -> 6
          f_2(11) -> 11
          f_2(13) -> 12
          f_2(15) -> 14
          g_0(1) -> 5
          g_0(3) -> 5
          g_0(4) -> 5
          g_0(5) -> 5
          g_1(9) -> 8
          g_1(11) -> 6
          g_1(11) -> 11
          g_2(14) -> 13
          mark_0(1) -> 6
          mark_0(3) -> 6
          mark_0(4) -> 6
          mark_0(5) -> 6
          mark_1(1) -> 11
          mark_1(3) -> 11
          mark_1(4) -> 11
          mark_1(5) -> 11
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            a__f(X) -> f(X)
            a__f(f(a())) -> c(f(g(f(a()))))
            mark(a()) -> a()
            mark(c(X)) -> c(X)
            mark(f(X)) -> a__f(mark(X))
            mark(g(X)) -> g(mark(X))
        - Signature:
            {a__f/1,mark/1} / {a/0,c/1,f/1,g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a__f,mark} and constructors {a,c,f,g}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))