The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, 1).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

a(b(x)) → a(c(b(x)))

Rewrite Strategy: INNERMOST

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

Converted Cpx (relative) TRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(b(z0)) → a(c(b(z0)))

Tuples:

A(b(z0)) → c1(A(c(b(z0))))

S tuples:

A(b(z0)) → c1(A(c(b(z0))))

K tuples:none
Defined Rule Symbols:

a

Defined Pair Symbols:

A

Compound Symbols:

c1

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

Removed 1 trailing nodes:

A(b(z0)) → c1(A(c(b(z0))))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(b(z0)) → a(c(b(z0)))

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

a

Defined Pair Symbols:none

Compound Symbols:none

(5) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)

The set S is empty

(6) BOUNDS(1, 1)