```* Step 1: ToInnermost WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
g(x,y) -> h(x,y)
h(f(x),y) -> f(g(x,y))
- Signature:
{g/2,h/2} / {f/1}
- Obligation:
runtime complexity wrt. defined symbols {g,h} and constructors {f}
+ Applied Processor:
ToInnermost
+ Details:
switch to innermost, as the system is overlay and right linear and does not contain weak rules
* Step 2: Bounds WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
g(x,y) -> h(x,y)
h(f(x),y) -> f(g(x,y))
- Signature:
{g/2,h/2} / {f/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {g,h} and constructors {f}
+ Applied Processor:
Bounds {initialAutomaton = minimal, enrichment = match}
+ Details:
The problem is match-bounded by 2.
The enriched problem is compatible with follwoing automaton.
f_0(2) -> 2
f_1(3) -> 1
f_1(3) -> 3
g_0(2,2) -> 1
g_1(2,2) -> 3
h_0(2,2) -> 1
h_1(2,2) -> 1
h_2(2,2) -> 3
* Step 3: EmptyProcessor WORST_CASE(?,O(1))
+ Considered Problem:
- Weak TRS:
g(x,y) -> h(x,y)
h(f(x),y) -> f(g(x,y))
- Signature:
{g/2,h/2} / {f/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {g,h} and constructors {f}
+ Applied Processor:
EmptyProcessor
+ Details:
The problem is already closed. The intended complexity is O(1).

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