*** 1 Progress [(O(1),O(n^2))] ***
Considered Problem:
Strict DP Rules:
Strict TRS Rules:
*(x,+(y,z)) -> +(*(x,y),*(x,z))
*(x,1()) -> x
*(+(x,y),z) -> +(*(x,z),*(y,z))
*(1(),y) -> y
Weak DP Rules:
Weak TRS Rules:
Signature:
{*/2} / {+/2,1/0}
Obligation:
Innermost
basic terms: {*}/{+,1}
Applied Processor:
NaturalPI {shape = Mixed 2, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules, greedy = NoGreedy}
Proof:
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(*) = 1 + 2*x1 + 7*x1*x2 + 7*x2
p(+) = 1 + x1 + x2
p(1) = 0
Following rules are strictly oriented:
*(x,+(y,z)) = 8 + 9*x + 7*x*y + 7*x*z + 7*y + 7*z
> 3 + 4*x + 7*x*y + 7*x*z + 7*y + 7*z
= +(*(x,y),*(x,z))
*(x,1()) = 1 + 2*x
> x
= x
*(1(),y) = 1 + 7*y
> y
= y
Following rules are (at-least) weakly oriented:
*(+(x,y),z) = 3 + 2*x + 7*x*z + 2*y + 7*y*z + 14*z
>= 3 + 2*x + 7*x*z + 2*y + 7*y*z + 14*z
= +(*(x,z),*(y,z))
*** 1.1 Progress [(O(1),O(n^2))] ***
Considered Problem:
Strict DP Rules:
Strict TRS Rules:
*(+(x,y),z) -> +(*(x,z),*(y,z))
Weak DP Rules:
Weak TRS Rules:
*(x,+(y,z)) -> +(*(x,y),*(x,z))
*(x,1()) -> x
*(1(),y) -> y
Signature:
{*/2} / {+/2,1/0}
Obligation:
Innermost
basic terms: {*}/{+,1}
Applied Processor:
NaturalPI {shape = Mixed 2, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules, greedy = NoGreedy}
Proof:
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(*) = 4*x1 + 5*x1*x2 + 2*x2
p(+) = 1 + x1 + x2
p(1) = 1
Following rules are strictly oriented:
*(+(x,y),z) = 4 + 4*x + 5*x*z + 4*y + 5*y*z + 7*z
> 1 + 4*x + 5*x*z + 4*y + 5*y*z + 4*z
= +(*(x,z),*(y,z))
Following rules are (at-least) weakly oriented:
*(x,+(y,z)) = 2 + 9*x + 5*x*y + 5*x*z + 2*y + 2*z
>= 1 + 8*x + 5*x*y + 5*x*z + 2*y + 2*z
= +(*(x,y),*(x,z))
*(x,1()) = 2 + 9*x
>= x
= x
*(1(),y) = 4 + 7*y
>= y
= y
*** 1.1.1 Progress [(O(1),O(1))] ***
Considered Problem:
Strict DP Rules:
Strict TRS Rules:
Weak DP Rules:
Weak TRS Rules:
*(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
basic terms: {*}/{+,1}
Applied Processor:
EmptyProcessor
Proof:
The problem is already closed. The intended complexity is O(1).