```* Step 1: Bounds WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
++(x,nil()) -> x
++(.(x,y),z) -> .(x,++(y,z))
++(nil(),y) -> y
make(x) -> .(x,nil())
rev(nil()) -> nil()
- Signature:
{++/2,make/1,rev/1} / {./2,nil/0}
- Obligation:
innermost runtime complexity wrt. defined symbols {++,make,rev} and constructors {.,nil}
+ Applied Processor:
Bounds {initialAutomaton = perSymbol, enrichment = match}
+ Details:
The problem is match-bounded by 1.
The enriched problem is compatible with follwoing automaton.
++_0(2,2) -> 1
++_0(2,4) -> 1
++_0(4,2) -> 1
++_0(4,4) -> 1
++_1(2,2) -> 6
++_1(2,4) -> 6
++_1(4,2) -> 6
++_1(4,4) -> 6
._0(2,2) -> 1
._0(2,2) -> 2
._0(2,2) -> 6
._0(2,4) -> 1
._0(2,4) -> 2
._0(2,4) -> 6
._0(4,2) -> 1
._0(4,2) -> 2
._0(4,2) -> 6
._0(4,4) -> 1
._0(4,4) -> 2
._0(4,4) -> 6
._1(2,6) -> 1
._1(2,6) -> 6
._1(2,7) -> 3
._1(4,6) -> 1
._1(4,6) -> 6
._1(4,7) -> 3
make_0(2) -> 3
make_0(4) -> 3
nil_0() -> 1
nil_0() -> 4
nil_0() -> 6
nil_1() -> 5
nil_1() -> 7
rev_0(2) -> 5
rev_0(4) -> 5
2 -> 1
2 -> 6
4 -> 1
4 -> 6
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
+ Considered Problem:
- Weak TRS:
++(x,nil()) -> x
++(.(x,y),z) -> .(x,++(y,z))
++(nil(),y) -> y
make(x) -> .(x,nil())
rev(nil()) -> nil()
- Signature:
{++/2,make/1,rev/1} / {./2,nil/0}
- Obligation:
innermost runtime complexity wrt. defined symbols {++,make,rev} and constructors {.,nil}
+ Applied Processor:
EmptyProcessor
+ Details:
The problem is already closed. The intended complexity is O(1).

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