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

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

(0) Obligation:

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

f(S(x)) → x 0.00/0.77
f(0) → 0 0.00/0.77
g(x) → g(x)

Rewrite Strategy: INNERMOST
0.00/0.77
0.00/0.77

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

Converted CpxTRS to CDT
0.00/0.77
0.00/0.77

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(S(z0)) → z0 0.00/0.77
f(0) → 0 0.00/0.77
g(z0) → g(z0)
Tuples:

G(z0) → c2(G(z0))
S tuples:

G(z0) → c2(G(z0))
K tuples:none
Defined Rule Symbols:

f, g

Defined Pair Symbols:

G

Compound Symbols:

c2

0.00/0.77
0.00/0.77
0.00/0.79 EOF