```* Step 1: MI WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
times(X,s(Y)) -> plus(X,times(Y,X))
- Signature:
{times/2} / {plus/2,s/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {times} and constructors {plus,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:
uargs(plus) = {2}

Following symbols are considered usable:
{times}
TcT has computed the following interpretation:
p(plus) = [1] x_2 + [0]
p(s) = [1] x_1 + [8]
p(times) = [1] x_1 + [1] x_2 + [1]

Following rules are strictly oriented:
times(X,s(Y)) = [1] X + [1] Y + [9]
> [1] X + [1] Y + [1]
= plus(X,times(Y,X))

Following rules are (at-least) weakly oriented:

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

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