### (0) Obligation:

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

The TRS R consists of the following rules:

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

Rewrite Strategy: FULL

### (1) RcToIrcProof (BOTH BOUNDS(ID, ID) transformation)

Converted rc-obligation to irc-obligation.

As the TRS does not nest defined symbols, we have rc = irc.

### (2) Obligation:

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

The TRS R consists of the following rules:

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

Rewrite Strategy: INNERMOST

### (3) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted Cpx (relative) TRS to CDT

### (4) 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

### (5) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID) transformation)

Removed 1 trailing nodes:

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

### (6) 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

### (7) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)

The set S is empty