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:

g(x, y) → x
g(x, y) → y
f(s(x), y, y) → f(y, x, s(x))

Rewrite Strategy: INNERMOST

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

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

Tuples:

F(s(z0), z1, z1) → c2(F(z1, z0, s(z0)))

S tuples:

F(s(z0), z1, z1) → c2(F(z1, z0, s(z0)))

K tuples:none
Defined Rule Symbols:

g, f

Defined Pair Symbols:

F

Compound Symbols:

c2

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

Removed 1 trailing nodes:

F(s(z0), z1, z1) → c2(F(z1, z0, s(z0)))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

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

g, f

Defined Pair Symbols:none

Compound Symbols:none

(5) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

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