```* Step 1: Bounds WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
minus(f(x,y)) -> f(minus(y),minus(x))
minus(h(x)) -> h(minus(x))
minus(minus(x)) -> x
- Signature:
{minus/1} / {f/2,h/1}
- Obligation:
runtime complexity wrt. defined symbols {minus} and constructors {f,h}
+ Applied Processor:
Bounds {initialAutomaton = perSymbol, enrichment = match}
+ Details:
The problem is match-bounded by 1.
The enriched problem is compatible with follwoing automaton.
f_0(1,1) -> 1
f_0(1,2) -> 1
f_0(2,1) -> 1
f_0(2,2) -> 1
f_1(4,5) -> 3
f_1(5,5) -> 3
f_1(5,5) -> 4
f_1(5,5) -> 5
h_0(1) -> 2
h_0(2) -> 2
h_1(5) -> 3
h_1(5) -> 5
minus_0(1) -> 3
minus_0(2) -> 3
minus_1(1) -> 4
minus_1(1) -> 5
minus_1(2) -> 5
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
+ Considered Problem:
- Weak TRS:
minus(f(x,y)) -> f(minus(y),minus(x))
minus(h(x)) -> h(minus(x))
minus(minus(x)) -> x
- Signature:
{minus/1} / {f/2,h/1}
- Obligation:
runtime complexity wrt. defined symbols {minus} and constructors {f,h}
+ Applied Processor:
EmptyProcessor
+ Details:
The problem is already closed. The intended complexity is O(1).

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