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

Rewrite Strategy: INNERMOST

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

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(g(z0, z1), z0, z2) → f(z2, z2, z2)
g(z0, z1) → z0
g(z0, z1) → z1

Tuples:

F(g(z0, z1), z0, z2) → c(F(z2, z2, z2))

S tuples:

F(g(z0, z1), z0, z2) → c(F(z2, z2, z2))

K tuples:none
Defined Rule Symbols:

f, g

Defined Pair Symbols:

F

Compound Symbols:

c

(3) CdtUnreachableProof (EQUIVALENT transformation)

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

F(g(z0, z1), z0, z2) → c(F(z2, z2, z2))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(g(z0, z1), z0, z2) → f(z2, z2, z2)
g(z0, z1) → z0
g(z0, z1) → z1

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))