* Step 1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: g(s(x)) -> g(x) - Signature: {g/1} / {s/1} - Obligation: innermost runtime complexity wrt. defined symbols {g} and constructors {s} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 1. The enriched problem is compatible with follwoing automaton. g_0(2) -> 1 g_1(2) -> 1 s_0(2) -> 2 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: g(s(x)) -> g(x) - Signature: {g/1} / {s/1} - Obligation: innermost runtime complexity wrt. defined symbols {g} and constructors {s} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))