YES(O(1), O(n^2)) 0.00/0.73 YES(O(1), O(n^2)) 0.00/0.74 0.00/0.74 0.00/0.74 0.00/0.74 0.00/0.74 0.00/0.74 Runtime Complexity (innermost) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml.xml 0.00/0.74 0.00/0.74 0.00/0.74
0.00/0.74
0.00/0.74
0.00/0.74
The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(O(1), O(n^2)).

0 CpxTRS
0.00/0.74 
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))
0.00/0.74 
↳2 CdtProblem
0.00/0.74 
↳3 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^2))))
0.00/0.74 
↳4 CdtProblem
0.00/0.74 
↳5 SIsEmptyProof (BOTH BOUNDS(ID, ID))
0.00/0.74 
↳6 BOUNDS(O(1), O(1))
0.00/0.74
0.00/0.74 0.00/0.74
0.00/0.74
0.00/0.74

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

*(x, +(y, z)) → +(*(x, y), *(x, z)) 0.00/0.74
*(+(x, y), z) → +(*(x, z), *(y, z)) 0.00/0.74
*(x, 1) → x 0.00/0.74
*(1, y) → y

Rewrite Strategy: INNERMOST
0.00/0.74
0.00/0.74

(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted CpxTRS to CDT
0.00/0.74
0.00/0.74

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

*(z0, +(z1, z2)) → +(*(z0, z1), *(z0, z2)) 0.00/0.74
*(+(z0, z1), z2) → +(*(z0, z2), *(z1, z2)) 0.00/0.74
*(z0, 1) → z0 0.00/0.74
*(1, z0) → z0
Tuples:

*'(z0, +(z1, z2)) → c(*'(z0, z1), *'(z0, z2)) 0.00/0.74
*'(+(z0, z1), z2) → c1(*'(z0, z2), *'(z1, z2))
S tuples:

*'(z0, +(z1, z2)) → c(*'(z0, z1), *'(z0, z2)) 0.00/0.74
*'(+(z0, z1), z2) → c1(*'(z0, z2), *'(z1, z2))
K tuples:none
Defined Rule Symbols:

*

Defined Pair Symbols:

*'

Compound Symbols:

c, c1

0.00/0.74
0.00/0.74

(3) CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^2))) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

*'(z0, +(z1, z2)) → c(*'(z0, z1), *'(z0, z2)) 0.00/0.74
*'(+(z0, z1), z2) → c1(*'(z0, z2), *'(z1, z2))
We considered the (Usable) Rules:none
And the Tuples:

*'(z0, +(z1, z2)) → c(*'(z0, z1), *'(z0, z2)) 0.00/0.74
*'(+(z0, z1), z2) → c1(*'(z0, z2), *'(z1, z2))
The order we found is given by the following interpretation:
Polynomial interpretation : 0.00/0.74

POL(*'(x1, x2)) = [2]x1 + [2]x2 + [2]x1·x2    0.00/0.74
POL(+(x1, x2)) = [1] + x1 + x2    0.00/0.74
POL(c(x1, x2)) = x1 + x2    0.00/0.74
POL(c1(x1, x2)) = x1 + x2   
0.00/0.74
0.00/0.74

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

*(z0, +(z1, z2)) → +(*(z0, z1), *(z0, z2)) 0.00/0.74
*(+(z0, z1), z2) → +(*(z0, z2), *(z1, z2)) 0.00/0.74
*(z0, 1) → z0 0.00/0.74
*(1, z0) → z0
Tuples:

*'(z0, +(z1, z2)) → c(*'(z0, z1), *'(z0, z2)) 0.00/0.74
*'(+(z0, z1), z2) → c1(*'(z0, z2), *'(z1, z2))
S tuples:none
K tuples:

*'(z0, +(z1, z2)) → c(*'(z0, z1), *'(z0, z2)) 0.00/0.74
*'(+(z0, z1), z2) → c1(*'(z0, z2), *'(z1, z2))
Defined Rule Symbols:

*

Defined Pair Symbols:

*'

Compound Symbols:

c, c1

0.00/0.74
0.00/0.74

(5) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)

The set S is empty
0.00/0.74
0.00/0.74

(6) BOUNDS(O(1), O(1))

0.00/0.74
0.00/0.74
0.00/0.78 EOF