The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(O(1), O(1)).

(0) Obligation:

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

f(X, g(X)) → f(1, g(X))
g(1) → g(0)

Rewrite Strategy: INNERMOST

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

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(z0, g(z0)) → f(1, g(z0))
g(1) → g(0)

Tuples:

F(z0, g(z0)) → c(F(1, g(z0)), G(z0))
G(1) → c1(G(0))

S tuples:

F(z0, g(z0)) → c(F(1, g(z0)), G(z0))
G(1) → c1(G(0))

K tuples:none
Defined Rule Symbols:

f, g

Defined Pair Symbols:

F, G

Compound Symbols:

c, c1

(3) CdtUnreachableProof (EQUIVALENT transformation)

The following tuples could be removed as they are not reachable from basic start terms:

F(z0, g(z0)) → c(F(1, g(z0)), G(z0))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(z0, g(z0)) → f(1, g(z0))
g(1) → g(0)

Tuples:

G(1) → c1(G(0))

S tuples:

G(1) → c1(G(0))

K tuples:none
Defined Rule Symbols:

f, g

Defined Pair Symbols:

G

Compound Symbols:

c1

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

Removed 1 trailing nodes:

G(1) → c1(G(0))

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(z0, g(z0)) → f(1, g(z0))
g(1) → g(0)

Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:

f, g

Defined Pair Symbols:none

Compound Symbols:none

(7) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(8) BOUNDS(O(1), O(1))