YES(O(1), O(n^1)) 0.00/0.70 YES(O(1), O(n^1)) 0.00/0.71 0.00/0.71 0.00/0.71 0.00/0.71 0.00/0.71 0.00/0.71 Runtime Complexity (innermost) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml.xml 0.00/0.71 0.00/0.71 0.00/0.71
0.00/0.71 0.00/0.71 0.00/0.71
0.00/0.71
0.00/0.71

(0) Obligation:

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

f(g(X)) → f(X)

Rewrite Strategy: INNERMOST
0.00/0.71
0.00/0.71

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

Converted CpxTRS to CDT
0.00/0.71
0.00/0.71

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(g(z0)) → f(z0)
Tuples:

F(g(z0)) → c(F(z0))
S tuples:

F(g(z0)) → c(F(z0))
K tuples:none
Defined Rule Symbols:

f

Defined Pair Symbols:

F

Compound Symbols:

c

0.00/0.71
0.00/0.71

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

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

F(g(z0)) → c(F(z0))
We considered the (Usable) Rules:none
And the Tuples:

F(g(z0)) → c(F(z0))
The order we found is given by the following interpretation:
Polynomial interpretation : 0.00/0.71

POL(F(x1)) = [3]x1    0.00/0.71
POL(c(x1)) = x1    0.00/0.71
POL(g(x1)) = [1] + x1   
0.00/0.71
0.00/0.71

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(g(z0)) → f(z0)
Tuples:

F(g(z0)) → c(F(z0))
S tuples:none
K tuples:

F(g(z0)) → c(F(z0))
Defined Rule Symbols:

f

Defined Pair Symbols:

F

Compound Symbols:

c

0.00/0.71
0.00/0.71

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

The set S is empty
0.00/0.71
0.00/0.71

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

0.00/0.71
0.00/0.71
0.00/0.73 EOF