```* Step 1: MI WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
f(s(x),y,y) -> f(y,x,s(x))
- Signature:
{f/3} / {s/1}
- Obligation:
runtime complexity wrt. defined symbols {f} and constructors {s}
+ Applied Processor:
MI {miKind = MaximalMatrix (UpperTriangular (Multiplicity Nothing)), miDimension = 1, miUArgs = UArgs, miURules = URules, miSelector = Just any strict-rules}
+ Details:
We apply a matrix interpretation of kind MaximalMatrix (UpperTriangular (Multiplicity Nothing)):

The following argument positions are considered usable:
none

Following symbols are considered usable:
all
TcT has computed the following interpretation:
p(f) = [5] x_1 + [4] x_2 + [1] x_3 + [0]
p(s) = [1] x_1 + [4]

Following rules are strictly oriented:
f(s(x),y,y) = [5] x + [5] y + [20]
> [5] x + [5] y + [4]
= f(y,x,s(x))

Following rules are (at-least) weakly oriented:

* Step 2: EmptyProcessor WORST_CASE(?,O(1))
+ Considered Problem:
- Weak TRS:
f(s(x),y,y) -> f(y,x,s(x))
- Signature:
{f/3} / {s/1}
- Obligation:
runtime complexity wrt. defined symbols {f} and constructors {s}
+ Applied Processor:
EmptyProcessor
+ Details:
The problem is already closed. The intended complexity is O(1).

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