```* Step 1: Bounds WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
rev(++(x,x)) -> rev(x)
rev(++(x,y)) -> ++(rev(y),rev(x))
rev(a()) -> a()
rev(b()) -> b()
- Signature:
{rev/1} / {++/2,a/0,b/0}
- Obligation:
innermost runtime complexity wrt. defined symbols {rev} and constructors {++,a,b}
+ Applied Processor:
Bounds {initialAutomaton = minimal, enrichment = match}
+ Details:
The problem is match-bounded by 1.
The enriched problem is compatible with follwoing automaton.
++_0(2,2) -> 2
++_1(1,1) -> 1
a_0() -> 2
a_1() -> 1
b_0() -> 2
b_1() -> 1
rev_0(2) -> 1
rev_1(2) -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
+ Considered Problem:
- Weak TRS:
rev(++(x,x)) -> rev(x)
rev(++(x,y)) -> ++(rev(y),rev(x))
rev(a()) -> a()
rev(b()) -> b()
- Signature:
{rev/1} / {++/2,a/0,b/0}
- Obligation:
innermost runtime complexity wrt. defined symbols {rev} and constructors {++,a,b}
+ Applied Processor:
EmptyProcessor
+ Details:
The problem is already closed. The intended complexity is O(1).

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