### (0) Obligation:

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

+(X, 0) → X
+(X, s(Y)) → s(+(X, Y))
double(X) → +(X, X)
f(0, s(0), X) → f(X, double(X), X)
g(X, Y) → X
g(X, Y) → Y

Rewrite Strategy: INNERMOST

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

Converted Cpx (relative) TRS to CDT

### (2) Obligation:

Complexity Dependency Tuples Problem
Rules:

+(z0, 0) → z0
+(z0, s(z1)) → s(+(z0, z1))
double(z0) → +(z0, z0)
f(0, s(0), z0) → f(z0, double(z0), z0)
g(z0, z1) → z0
g(z0, z1) → z1
Tuples:

+'(z0, 0) → c
+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), z0) → c3(F(z0, double(z0), z0), DOUBLE(z0))
G(z0, z1) → c4
G(z0, z1) → c5
S tuples:

+'(z0, 0) → c
+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), z0) → c3(F(z0, double(z0), z0), DOUBLE(z0))
G(z0, z1) → c4
G(z0, z1) → c5
K tuples:none
Defined Rule Symbols:

+, double, f, g

Defined Pair Symbols:

+', DOUBLE, F, G

Compound Symbols:

c, c1, c2, c3, c4, c5

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

Removed 3 trailing nodes:

+'(z0, 0) → c
G(z0, z1) → c5
G(z0, z1) → c4

### (4) Obligation:

Complexity Dependency Tuples Problem
Rules:

+(z0, 0) → z0
+(z0, s(z1)) → s(+(z0, z1))
double(z0) → +(z0, z0)
f(0, s(0), z0) → f(z0, double(z0), z0)
g(z0, z1) → z0
g(z0, z1) → z1
Tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), z0) → c3(F(z0, double(z0), z0), DOUBLE(z0))
S tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), z0) → c3(F(z0, double(z0), z0), DOUBLE(z0))
K tuples:none
Defined Rule Symbols:

+, double, f, g

Defined Pair Symbols:

+', DOUBLE, F

Compound Symbols:

c1, c2, c3

### (5) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

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

### (6) Obligation:

Complexity Dependency Tuples Problem
Rules:

double(z0) → +(z0, z0)
+(z0, 0) → z0
+(z0, s(z1)) → s(+(z0, z1))
Tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), z0) → c3(F(z0, double(z0), z0), DOUBLE(z0))
S tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), z0) → c3(F(z0, double(z0), z0), DOUBLE(z0))
K tuples:none
Defined Rule Symbols:

double, +

Defined Pair Symbols:

+', DOUBLE, F

Compound Symbols:

c1, c2, c3

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

Use narrowing to replace F(0, s(0), z0) → c3(F(z0, double(z0), z0), DOUBLE(z0)) by

F(0, s(0), z0) → c3(F(z0, +(z0, z0), z0), DOUBLE(z0))

### (8) Obligation:

Complexity Dependency Tuples Problem
Rules:

double(z0) → +(z0, z0)
+(z0, 0) → z0
+(z0, s(z1)) → s(+(z0, z1))
Tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), z0) → c3(F(z0, +(z0, z0), z0), DOUBLE(z0))
S tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), z0) → c3(F(z0, +(z0, z0), z0), DOUBLE(z0))
K tuples:none
Defined Rule Symbols:

double, +

Defined Pair Symbols:

+', DOUBLE, F

Compound Symbols:

c1, c2, c3

### (9) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

double(z0) → +(z0, z0)

### (10) Obligation:

Complexity Dependency Tuples Problem
Rules:

+(z0, 0) → z0
+(z0, s(z1)) → s(+(z0, z1))
Tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), z0) → c3(F(z0, +(z0, z0), z0), DOUBLE(z0))
S tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), z0) → c3(F(z0, +(z0, z0), z0), DOUBLE(z0))
K tuples:none
Defined Rule Symbols:

+

Defined Pair Symbols:

+', DOUBLE, F

Compound Symbols:

c1, c2, c3

### (11) CdtNarrowingProof (BOTH BOUNDS(ID, ID) transformation)

Use narrowing to replace F(0, s(0), z0) → c3(F(z0, +(z0, z0), z0), DOUBLE(z0)) by

F(0, s(0), 0) → c3(F(0, 0, 0), DOUBLE(0))
F(0, s(0), s(z1)) → c3(F(s(z1), s(+(s(z1), z1)), s(z1)), DOUBLE(s(z1)))
F(0, s(0), x0) → c3(DOUBLE(x0))

### (12) Obligation:

Complexity Dependency Tuples Problem
Rules:

+(z0, 0) → z0
+(z0, s(z1)) → s(+(z0, z1))
Tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), 0) → c3(F(0, 0, 0), DOUBLE(0))
F(0, s(0), s(z1)) → c3(F(s(z1), s(+(s(z1), z1)), s(z1)), DOUBLE(s(z1)))
F(0, s(0), x0) → c3(DOUBLE(x0))
S tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), 0) → c3(F(0, 0, 0), DOUBLE(0))
F(0, s(0), s(z1)) → c3(F(s(z1), s(+(s(z1), z1)), s(z1)), DOUBLE(s(z1)))
F(0, s(0), x0) → c3(DOUBLE(x0))
K tuples:none
Defined Rule Symbols:

+

Defined Pair Symbols:

+', DOUBLE, F

Compound Symbols:

c1, c2, c3, c3

### (13) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

F(0, s(0), 0) → c3(F(0, 0, 0), DOUBLE(0))
F(0, s(0), x0) → c3(DOUBLE(x0))

### (14) Obligation:

Complexity Dependency Tuples Problem
Rules:

+(z0, 0) → z0
+(z0, s(z1)) → s(+(z0, z1))
Tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), s(z1)) → c3(F(s(z1), s(+(s(z1), z1)), s(z1)), DOUBLE(s(z1)))
S tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), s(z1)) → c3(F(s(z1), s(+(s(z1), z1)), s(z1)), DOUBLE(s(z1)))
K tuples:none
Defined Rule Symbols:

+

Defined Pair Symbols:

+', DOUBLE, F

Compound Symbols:

c1, c2, c3

### (15) CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID) transformation)

Removed 1 trailing tuple parts

### (16) Obligation:

Complexity Dependency Tuples Problem
Rules:

+(z0, 0) → z0
+(z0, s(z1)) → s(+(z0, z1))
Tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), s(z1)) → c3(DOUBLE(s(z1)))
S tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
DOUBLE(z0) → c2(+'(z0, z0))
F(0, s(0), s(z1)) → c3(DOUBLE(s(z1)))
K tuples:none
Defined Rule Symbols:

+

Defined Pair Symbols:

+', DOUBLE, F

Compound Symbols:

c1, c2, c3

### (17) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

F(0, s(0), s(z1)) → c3(DOUBLE(s(z1)))
DOUBLE(z0) → c2(+'(z0, z0))

### (18) Obligation:

Complexity Dependency Tuples Problem
Rules:

+(z0, 0) → z0
+(z0, s(z1)) → s(+(z0, z1))
Tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
S tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
K tuples:none
Defined Rule Symbols:

+

Defined Pair Symbols:

+'

Compound Symbols:

c1

### (19) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

+(z0, 0) → z0
+(z0, s(z1)) → s(+(z0, z1))

### (20) Obligation:

Complexity Dependency Tuples Problem
Rules:none
Tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
S tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
K tuples:none
Defined Rule Symbols:none

Defined Pair Symbols:

+'

Compound Symbols:

c1

### (21) CdtRuleRemovalProof (UPPER BOUND (ADD(O(n^1))) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

+'(z0, s(z1)) → c1(+'(z0, z1))
We considered the (Usable) Rules:none
And the Tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(+'(x1, x2)) = [5]x2
POL(c1(x1)) = x1
POL(s(x1)) = [1] + x1

### (22) Obligation:

Complexity Dependency Tuples Problem
Rules:none
Tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
S tuples:none
K tuples:

+'(z0, s(z1)) → c1(+'(z0, z1))
Defined Rule Symbols:none

Defined Pair Symbols:

+'

Compound Symbols:

c1

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

The set S is empty