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

Tuples:

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

S tuples:

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

K tuples:none
Defined Rule Symbols:

f

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

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

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

f

Defined Pair Symbols:none

Compound Symbols:none

(5) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

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