```* Step 1: Bounds WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
a__f(X) -> f(X)
a__f(X) -> g(h(f(X)))
mark(f(X)) -> a__f(mark(X))
mark(g(X)) -> g(X)
mark(h(X)) -> h(mark(X))
- Signature:
{a__f/1,mark/1} / {f/1,g/1,h/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {a__f,mark} and constructors {f,g,h}
+ Applied Processor:
Bounds {initialAutomaton = minimal, enrichment = match}
+ Details:
The problem is match-bounded by 2.
The enriched problem is compatible with follwoing automaton.
a__f_0(2) -> 1
a__f_1(4) -> 1
a__f_1(4) -> 4
f_0(2) -> 2
f_1(2) -> 1
f_2(4) -> 1
f_2(4) -> 4
g_0(2) -> 2
g_1(2) -> 1
g_1(2) -> 4
g_1(3) -> 1
g_2(5) -> 1
g_2(5) -> 4
h_0(2) -> 2
h_1(1) -> 3
h_1(4) -> 1
h_1(4) -> 4
h_2(1) -> 5
mark_0(2) -> 1
mark_1(2) -> 4
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
+ Considered Problem:
- Weak TRS:
a__f(X) -> f(X)
a__f(X) -> g(h(f(X)))
mark(f(X)) -> a__f(mark(X))
mark(g(X)) -> g(X)
mark(h(X)) -> h(mark(X))
- Signature:
{a__f/1,mark/1} / {f/1,g/1,h/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {a__f,mark} and constructors {f,g,h}
+ Applied Processor:
EmptyProcessor
+ Details:
The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))
```