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

Rewrite Strategy: INNERMOST

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

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(f(a, a), z0) → f(z0, f(a, f(a, a)))

Tuples:

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

S tuples:

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

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

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

f(f(a, a), z0) → f(z0, f(a, f(a, a)))

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