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(f(x)) → g(f(x))
g(g(x)) → f(x)

Rewrite Strategy: INNERMOST

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

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(f(z0)) → g(f(z0))
g(g(z0)) → f(z0)

Tuples:

F(f(z0)) → c(G(f(z0)), F(z0))
G(g(z0)) → c1(F(z0))

S tuples:

F(f(z0)) → c(G(f(z0)), F(z0))
G(g(z0)) → c1(F(z0))

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(f(z0)) → c(G(f(z0)), F(z0))
G(g(z0)) → c1(F(z0))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(f(z0)) → g(f(z0))
g(g(z0)) → f(z0)

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

f, g

Defined Pair Symbols:none

Compound Symbols:none

(5) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

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