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(a, b, X) → f(X, X, X)
c → a
c → b

Rewrite Strategy: INNERMOST

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

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(a, b, z0) → f(z0, z0, z0)
c → a
c → b

Tuples:

F(a, b, z0) → c1(F(z0, z0, z0))

S tuples:

F(a, b, z0) → c1(F(z0, z0, z0))

K tuples:none
Defined Rule Symbols:

f, c

Defined Pair Symbols:

F

Compound Symbols:

c1

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

Removed 1 trailing nodes:

F(a, b, z0) → c1(F(z0, z0, z0))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(a, b, z0) → f(z0, z0, z0)
c → a
c → b

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

f, c

Defined Pair Symbols:none

Compound Symbols:none

(5) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

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