```* Step 1: NaturalPI WORST_CASE(?,O(n^2))
+ Considered Problem:
- Strict TRS:
*(x,+(y,z)) -> +(*(x,y),*(x,z))
*(x,1()) -> x
*(+(x,y),z) -> +(*(x,z),*(y,z))
*(1(),y) -> y
- Signature:
{*/2} / {+/2,1/0}
- Obligation:
innermost runtime complexity wrt. defined symbols {*} and constructors {+,1}
+ Applied Processor:
NaturalPI {shape = Mixed 2, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules}
+ Details:
We apply a polynomial interpretation of kind constructor-based(mixed(2)):
The following argument positions are considered usable:
uargs(+) = {1,2}

Following symbols are considered usable:
{*}
TcT has computed the following interpretation:
p(*) = 2*x1 + 2*x1*x2 + x2
p(+) = 1 + x1 + x2
p(1) = 1

Following rules are strictly oriented:
*(x,1()) = 1 + 4*x
> x
= x

*(+(x,y),z) = 2 + 2*x + 2*x*z + 2*y + 2*y*z + 3*z
> 1 + 2*x + 2*x*z + 2*y + 2*y*z + 2*z
= +(*(x,z),*(y,z))

*(1(),y) = 2 + 3*y
> y
= y

Following rules are (at-least) weakly oriented:
*(x,+(y,z)) =  1 + 4*x + 2*x*y + 2*x*z + y + z
>= 1 + 4*x + 2*x*y + 2*x*z + y + z
=  +(*(x,y),*(x,z))

* Step 2: NaturalPI WORST_CASE(?,O(n^2))
+ Considered Problem:
- Strict TRS:
*(x,+(y,z)) -> +(*(x,y),*(x,z))
- Weak TRS:
*(x,1()) -> x
*(+(x,y),z) -> +(*(x,z),*(y,z))
*(1(),y) -> y
- Signature:
{*/2} / {+/2,1/0}
- Obligation:
innermost runtime complexity wrt. defined symbols {*} and constructors {+,1}
+ Applied Processor:
NaturalPI {shape = Mixed 2, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules}
+ Details:
We apply a polynomial interpretation of kind constructor-based(mixed(2)):
The following argument positions are considered usable:
uargs(+) = {1,2}

Following symbols are considered usable:
{*}
TcT has computed the following interpretation:
p(*) = 3 + 5*x1 + 6*x1*x2 + 5*x2
p(+) = 1 + x1 + x2
p(1) = 1

Following rules are strictly oriented:
*(x,+(y,z)) = 8 + 11*x + 6*x*y + 6*x*z + 5*y + 5*z
> 7 + 10*x + 6*x*y + 6*x*z + 5*y + 5*z
= +(*(x,y),*(x,z))

Following rules are (at-least) weakly oriented:
*(x,1()) =  8 + 11*x
>= x
=  x

*(+(x,y),z) =  8 + 5*x + 6*x*z + 5*y + 6*y*z + 11*z
>= 7 + 5*x + 6*x*z + 5*y + 6*y*z + 10*z
=  +(*(x,z),*(y,z))

*(1(),y) =  8 + 11*y
>= y
=  y

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

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