```* Step 1: Bounds WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
a(c(d(x))) -> c(x)
u(b(d(d(x)))) -> b(x)
v(a(a(x))) -> u(v(x))
v(a(c(x))) -> u(b(d(x)))
v(c(x)) -> b(x)
w(a(a(x))) -> u(w(x))
w(a(c(x))) -> u(b(d(x)))
w(c(x)) -> b(x)
- Signature:
{a/1,u/1,v/1,w/1} / {b/1,c/1,d/1}
- Obligation:
runtime complexity wrt. defined symbols {a,u,v,w} and constructors {b,c,d}
+ Applied Processor:
Bounds {initialAutomaton = minimal, enrichment = match}
+ Details:
The problem is match-bounded by 1.
The enriched problem is compatible with follwoing automaton.
a_0(2) -> 1
b_0(2) -> 2
b_1(2) -> 1
c_0(2) -> 2
c_1(2) -> 1
d_0(2) -> 2
u_0(2) -> 1
v_0(2) -> 1
w_0(2) -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
+ Considered Problem:
- Weak TRS:
a(c(d(x))) -> c(x)
u(b(d(d(x)))) -> b(x)
v(a(a(x))) -> u(v(x))
v(a(c(x))) -> u(b(d(x)))
v(c(x)) -> b(x)
w(a(a(x))) -> u(w(x))
w(a(c(x))) -> u(b(d(x)))
w(c(x)) -> b(x)
- Signature:
{a/1,u/1,v/1,w/1} / {b/1,c/1,d/1}
- Obligation:
runtime complexity wrt. defined symbols {a,u,v,w} and constructors {b,c,d}
+ Applied Processor:
EmptyProcessor
+ Details:
The problem is already closed. The intended complexity is O(1).

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