MAYBE 0.00/0.75 MAYBE 0.00/0.76 0.00/0.76 0.00/0.76 0.00/0.76 0.00/0.76 0.00/0.76 Runtime Complexity (innermost) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml.xml 0.00/0.76 0.00/0.76 0.00/0.76
0.00/0.76
0.00/0.76
0.00/0.76
The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(O(1), INFINITE).

0 CpxTRS
0.00/0.76 
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))
0.00/0.76 
↳2 CdtProblem
0.00/0.76
0.00/0.76 0.00/0.76
0.00/0.76
0.00/0.76

(0) Obligation:

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

f(x) → f(x)

Rewrite Strategy: INNERMOST
0.00/0.76
0.00/0.76

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

Converted CpxTRS to CDT
0.00/0.76
0.00/0.76

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(z0) → f(z0)
Tuples:

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

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

f

Defined Pair Symbols:

F

Compound Symbols:

c

0.00/0.76
0.00/0.76
0.00/0.78 EOF