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

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

(0) Obligation:

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

f(a) → f(a)

Rewrite Strategy: INNERMOST
0.00/0.80
0.00/0.80

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

Converted CpxTRS to CDT
0.00/0.80
0.00/0.80

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(a) → f(a)
Tuples:

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

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

f

Defined Pair Symbols:

F

Compound Symbols:

c

0.00/0.80
0.00/0.80
0.00/0.83 EOF