Runtime Complexity (innermost) proof of /tmp/tmp3iFSSH/PEANO_nokinds-noand

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

0 CpxTRS

↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID), 0 ms)

↳2 CdtProblem

↳3 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)

↳4 CdtProblem

↳5 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID), 0 ms)

↳6 CdtProblem

↳7 CdtKnowledgeProof (BOTH BOUNDS(ID, ID), 0 ms)

↳8 CdtProblem

↳9 CdtUsableRulesProof (⇔, 0 ms)

↳10 CdtProblem

↳11 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 232 ms)

↳12 CdtProblem

↳13 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 75 ms)

↳14 CdtProblem

↳15 CdtKnowledgeProof (⇔, 0 ms)

↳16 BOUNDS(1, 1)

(0) Obligation:

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

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, N) → activate(N)
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(N, 0) → U31(isNat(N), N)
plus(N, s(M)) → U41(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Rewrite Strategy: INNERMOST

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

Converted Cpx (relative) TRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

U11(tt, z0) → U12(isNat(activate(z0)))
U12(tt) → tt
U21(tt) → tt
U31(tt, z0) → activate(z0)
U41(tt, z0, z1) → U42(isNat(activate(z1)), activate(z0), activate(z1))
U42(tt, z0, z1) → s(plus(activate(z1), activate(z0)))
isNat(n__0) → tt
isNat(n__plus(z0, z1)) → U11(isNat(activate(z0)), activate(z1))
isNat(n__s(z0)) → U21(isNat(activate(z0)))
plus(z0, 0) → U31(isNat(z0), z0)
plus(z0, s(z1)) → U41(isNat(z1), z1, z0)
plus(z0, z1) → n__plus(z0, z1)
0 → n__0
s(z0) → n__s(z0)
activate(n__0) → 0
activate(n__plus(z0, z1)) → plus(z0, z1)
activate(n__s(z0)) → s(z0)
activate(z0) → z0

Tuples:

U11'(tt, z0) → c(U12'(isNat(activate(z0))), ISNAT(activate(z0)), ACTIVATE(z0))
U12'(tt) → c1
U21'(tt) → c2
U31'(tt, z0) → c3(ACTIVATE(z0))
U41'(tt, z0, z1) → c4(U42'(isNat(activate(z1)), activate(z0), activate(z1)), ISNAT(activate(z1)), ACTIVATE(z1), ACTIVATE(z0), ACTIVATE(z1))
U42'(tt, z0, z1) → c5(S(plus(activate(z1), activate(z0))), PLUS(activate(z1), activate(z0)), ACTIVATE(z1), ACTIVATE(z0))
ISNAT(n__0) → c6
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)), ACTIVATE(z0), ACTIVATE(z1))
ISNAT(n__s(z0)) → c8(U21'(isNat(activate(z0))), ISNAT(activate(z0)), ACTIVATE(z0))
PLUS(z0, 0) → c9(U31'(isNat(z0), z0), ISNAT(z0))
PLUS(z0, s(z1)) → c10(U41'(isNat(z1), z1, z0), ISNAT(z1))
PLUS(z0, z1) → c11
0' → c12
S(z0) → c13
ACTIVATE(n__0) → c14(0')
ACTIVATE(n__plus(z0, z1)) → c15(PLUS(z0, z1))
ACTIVATE(n__s(z0)) → c16(S(z0))
ACTIVATE(z0) → c17

S tuples:

U11'(tt, z0) → c(U12'(isNat(activate(z0))), ISNAT(activate(z0)), ACTIVATE(z0))
U12'(tt) → c1
U21'(tt) → c2
U31'(tt, z0) → c3(ACTIVATE(z0))
U41'(tt, z0, z1) → c4(U42'(isNat(activate(z1)), activate(z0), activate(z1)), ISNAT(activate(z1)), ACTIVATE(z1), ACTIVATE(z0), ACTIVATE(z1))
U42'(tt, z0, z1) → c5(S(plus(activate(z1), activate(z0))), PLUS(activate(z1), activate(z0)), ACTIVATE(z1), ACTIVATE(z0))
ISNAT(n__0) → c6
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)), ACTIVATE(z0), ACTIVATE(z1))
ISNAT(n__s(z0)) → c8(U21'(isNat(activate(z0))), ISNAT(activate(z0)), ACTIVATE(z0))
PLUS(z0, 0) → c9(U31'(isNat(z0), z0), ISNAT(z0))
PLUS(z0, s(z1)) → c10(U41'(isNat(z1), z1, z0), ISNAT(z1))
PLUS(z0, z1) → c11
0' → c12
S(z0) → c13
ACTIVATE(n__0) → c14(0')
ACTIVATE(n__plus(z0, z1)) → c15(PLUS(z0, z1))
ACTIVATE(n__s(z0)) → c16(S(z0))
ACTIVATE(z0) → c17

K tuples:none
Defined Rule Symbols:

U11, U12, U21, U31, U41, U42, isNat, plus, 0, s, activate

Defined Pair Symbols:

U11', U12', U21', U31', U41', U42', ISNAT, PLUS, 0', S, ACTIVATE

Compound Symbols:

c, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17

(3) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 2 leading nodes:

PLUS(z0, 0) → c9(U31'(isNat(z0), z0), ISNAT(z0))
PLUS(z0, s(z1)) → c10(U41'(isNat(z1), z1, z0), ISNAT(z1))

Removed 12 trailing nodes:

U21'(tt) → c2
PLUS(z0, z1) → c11
U12'(tt) → c1
S(z0) → c13
0' → c12
ACTIVATE(n__0) → c14(0')
ACTIVATE(z0) → c17
ACTIVATE(n__plus(z0, z1)) → c15(PLUS(z0, z1))
U31'(tt, z0) → c3(ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c16(S(z0))
ISNAT(n__0) → c6
U42'(tt, z0, z1) → c5(S(plus(activate(z1), activate(z0))), PLUS(activate(z1), activate(z0)), ACTIVATE(z1), ACTIVATE(z0))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

U11(tt, z0) → U12(isNat(activate(z0)))
U12(tt) → tt
U21(tt) → tt
U31(tt, z0) → activate(z0)
U41(tt, z0, z1) → U42(isNat(activate(z1)), activate(z0), activate(z1))
U42(tt, z0, z1) → s(plus(activate(z1), activate(z0)))
isNat(n__0) → tt
isNat(n__plus(z0, z1)) → U11(isNat(activate(z0)), activate(z1))
isNat(n__s(z0)) → U21(isNat(activate(z0)))
plus(z0, 0) → U31(isNat(z0), z0)
plus(z0, s(z1)) → U41(isNat(z1), z1, z0)
plus(z0, z1) → n__plus(z0, z1)
0 → n__0
s(z0) → n__s(z0)
activate(n__0) → 0
activate(n__plus(z0, z1)) → plus(z0, z1)
activate(n__s(z0)) → s(z0)
activate(z0) → z0

Tuples:

U11'(tt, z0) → c(U12'(isNat(activate(z0))), ISNAT(activate(z0)), ACTIVATE(z0))
U41'(tt, z0, z1) → c4(U42'(isNat(activate(z1)), activate(z0), activate(z1)), ISNAT(activate(z1)), ACTIVATE(z1), ACTIVATE(z0), ACTIVATE(z1))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)), ACTIVATE(z0), ACTIVATE(z1))
ISNAT(n__s(z0)) → c8(U21'(isNat(activate(z0))), ISNAT(activate(z0)), ACTIVATE(z0))

S tuples:

U11'(tt, z0) → c(U12'(isNat(activate(z0))), ISNAT(activate(z0)), ACTIVATE(z0))
U41'(tt, z0, z1) → c4(U42'(isNat(activate(z1)), activate(z0), activate(z1)), ISNAT(activate(z1)), ACTIVATE(z1), ACTIVATE(z0), ACTIVATE(z1))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)), ACTIVATE(z0), ACTIVATE(z1))
ISNAT(n__s(z0)) → c8(U21'(isNat(activate(z0))), ISNAT(activate(z0)), ACTIVATE(z0))

K tuples:none
Defined Rule Symbols:

U11, U12, U21, U31, U41, U42, isNat, plus, 0, s, activate

Defined Pair Symbols:

U11', U41', ISNAT

Compound Symbols:

c, c4, c7, c8

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

Removed 10 trailing tuple parts

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

U11(tt, z0) → U12(isNat(activate(z0)))
U12(tt) → tt
U21(tt) → tt
U31(tt, z0) → activate(z0)
U41(tt, z0, z1) → U42(isNat(activate(z1)), activate(z0), activate(z1))
U42(tt, z0, z1) → s(plus(activate(z1), activate(z0)))
isNat(n__0) → tt
isNat(n__plus(z0, z1)) → U11(isNat(activate(z0)), activate(z1))
isNat(n__s(z0)) → U21(isNat(activate(z0)))
plus(z0, 0) → U31(isNat(z0), z0)
plus(z0, s(z1)) → U41(isNat(z1), z1, z0)
plus(z0, z1) → n__plus(z0, z1)
0 → n__0
s(z0) → n__s(z0)
activate(n__0) → 0
activate(n__plus(z0, z1)) → plus(z0, z1)
activate(n__s(z0)) → s(z0)
activate(z0) → z0

Tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))
U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

S tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))
U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

K tuples:none
Defined Rule Symbols:

U11, U12, U21, U31, U41, U42, isNat, plus, 0, s, activate

Defined Pair Symbols:

U11', U41', ISNAT

Compound Symbols:

c, c4, c7, c8

(7) CdtKnowledgeProof (BOTH BOUNDS(ID, ID) transformation)

The following tuples could be moved from S to K by knowledge propagation:

U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

U11(tt, z0) → U12(isNat(activate(z0)))
U12(tt) → tt
U21(tt) → tt
U31(tt, z0) → activate(z0)
U41(tt, z0, z1) → U42(isNat(activate(z1)), activate(z0), activate(z1))
U42(tt, z0, z1) → s(plus(activate(z1), activate(z0)))
isNat(n__0) → tt
isNat(n__plus(z0, z1)) → U11(isNat(activate(z0)), activate(z1))
isNat(n__s(z0)) → U21(isNat(activate(z0)))
plus(z0, 0) → U31(isNat(z0), z0)
plus(z0, s(z1)) → U41(isNat(z1), z1, z0)
plus(z0, z1) → n__plus(z0, z1)
0 → n__0
s(z0) → n__s(z0)
activate(n__0) → 0
activate(n__plus(z0, z1)) → plus(z0, z1)
activate(n__s(z0)) → s(z0)
activate(z0) → z0

Tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))
U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

S tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

K tuples:

U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))

Defined Rule Symbols:

U11, U12, U21, U31, U41, U42, isNat, plus, 0, s, activate

Defined Pair Symbols:

U11', U41', ISNAT

Compound Symbols:

c, c4, c7, c8

(9) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

U31(tt, z0) → activate(z0)
U41(tt, z0, z1) → U42(isNat(activate(z1)), activate(z0), activate(z1))
U42(tt, z0, z1) → s(plus(activate(z1), activate(z0)))
plus(z0, 0) → U31(isNat(z0), z0)
plus(z0, s(z1)) → U41(isNat(z1), z1, z0)

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

activate(n__0) → 0
activate(n__plus(z0, z1)) → plus(z0, z1)
activate(n__s(z0)) → s(z0)
activate(z0) → z0
0 → n__0
plus(z0, z1) → n__plus(z0, z1)
s(z0) → n__s(z0)
isNat(n__0) → tt
isNat(n__plus(z0, z1)) → U11(isNat(activate(z0)), activate(z1))
isNat(n__s(z0)) → U21(isNat(activate(z0)))
U11(tt, z0) → U12(isNat(activate(z0)))
U21(tt) → tt
U12(tt) → tt

Tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))
U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

S tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

K tuples:

U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))

Defined Rule Symbols:

activate, 0, plus, s, isNat, U11, U21, U12

Defined Pair Symbols:

U11', U41', ISNAT

Compound Symbols:

c, c4, c7, c8

(11) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

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

ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

We considered the (Usable) Rules:

plus(z0, z1) → n__plus(z0, z1)
activate(n__0) → 0
0 → n__0
activate(z0) → z0
s(z0) → n__s(z0)
activate(n__s(z0)) → s(z0)
activate(n__plus(z0, z1)) → plus(z0, z1)

And the Tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))
U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = [3]
POL(ISNAT(x₁)) = [4]x₁
POL(U11(x₁, x₂)) = [3] + [2]x₁ + [2]x₂
POL(U11'(x₁, x₂)) = [4]x₂
POL(U12(x₁)) = [3] + [4]x₁
POL(U21(x₁)) = [3] + [3]x₁
POL(U41'(x₁, x₂, x₃)) = [3] + [4]x₁ + [4]x₃
POL(activate(x₁)) = x₁
POL(c(x₁)) = x₁
POL(c4(x₁)) = x₁
POL(c7(x₁, x₂)) = x₁ + x₂
POL(c8(x₁)) = x₁
POL(isNat(x₁)) = [3]
POL(n__0) = [3]
POL(n__plus(x₁, x₂)) = x₁ + x₂
POL(n__s(x₁)) = [1] + x₁
POL(plus(x₁, x₂)) = x₁ + x₂
POL(s(x₁)) = [1] + x₁
POL(tt) = 0

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:

activate(n__0) → 0
activate(n__plus(z0, z1)) → plus(z0, z1)
activate(n__s(z0)) → s(z0)
activate(z0) → z0
0 → n__0
plus(z0, z1) → n__plus(z0, z1)
s(z0) → n__s(z0)
isNat(n__0) → tt
isNat(n__plus(z0, z1)) → U11(isNat(activate(z0)), activate(z1))
isNat(n__s(z0)) → U21(isNat(activate(z0)))
U11(tt, z0) → U12(isNat(activate(z0)))
U21(tt) → tt
U12(tt) → tt

Tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))
U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

S tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))

K tuples:

U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

Defined Rule Symbols:

activate, 0, plus, s, isNat, U11, U21, U12

Defined Pair Symbols:

U11', U41', ISNAT

Compound Symbols:

c, c4, c7, c8

(13) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

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

ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))

We considered the (Usable) Rules:

plus(z0, z1) → n__plus(z0, z1)
activate(n__0) → 0
0 → n__0
activate(z0) → z0
s(z0) → n__s(z0)
activate(n__s(z0)) → s(z0)
activate(n__plus(z0, z1)) → plus(z0, z1)

And the Tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))
U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = [4]
POL(ISNAT(x₁)) = [4]x₁
POL(U11(x₁, x₂)) = [2] + [3]x₁ + [3]x₂
POL(U11'(x₁, x₂)) = [4]x₂
POL(U12(x₁)) = [2] + [2]x₁
POL(U21(x₁)) = [3] + [2]x₁
POL(U41'(x₁, x₂, x₃)) = [2] + [4]x₁ + [4]x₃
POL(activate(x₁)) = x₁
POL(c(x₁)) = x₁
POL(c4(x₁)) = x₁
POL(c7(x₁, x₂)) = x₁ + x₂
POL(c8(x₁)) = x₁
POL(isNat(x₁)) = 0
POL(n__0) = [4]
POL(n__plus(x₁, x₂)) = [2] + x₁ + x₂
POL(n__s(x₁)) = x₁
POL(plus(x₁, x₂)) = [2] + x₁ + x₂
POL(s(x₁)) = x₁
POL(tt) = [2]

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:

activate(n__0) → 0
activate(n__plus(z0, z1)) → plus(z0, z1)
activate(n__s(z0)) → s(z0)
activate(z0) → z0
0 → n__0
plus(z0, z1) → n__plus(z0, z1)
s(z0) → n__s(z0)
isNat(n__0) → tt
isNat(n__plus(z0, z1)) → U11(isNat(activate(z0)), activate(z1))
isNat(n__s(z0)) → U21(isNat(activate(z0)))
U11(tt, z0) → U12(isNat(activate(z0)))
U21(tt) → tt
U12(tt) → tt

Tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))
U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

S tuples:

U11'(tt, z0) → c(ISNAT(activate(z0)))

K tuples:

U41'(tt, z0, z1) → c4(ISNAT(activate(z1)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))

Defined Rule Symbols:

activate, 0, plus, s, isNat, U11, U21, U12

Defined Pair Symbols:

U11', U41', ISNAT

Compound Symbols:

c, c4, c7, c8

(15) CdtKnowledgeProof (EQUIVALENT transformation)

The following tuples could be moved from S to K by knowledge propagation:

U11'(tt, z0) → c(ISNAT(activate(z0)))
ISNAT(n__plus(z0, z1)) → c7(U11'(isNat(activate(z0)), activate(z1)), ISNAT(activate(z0)))
ISNAT(n__s(z0)) → c8(ISNAT(activate(z0)))

Now S is empty

(0) Obligation:

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

(2) Obligation:

(3) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

(4) Obligation:

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

(6) Obligation:

(7) CdtKnowledgeProof (BOTH BOUNDS(ID, ID) transformation)

(8) Obligation:

(9) CdtUsableRulesProof (EQUIVALENT transformation)

(10) Obligation:

(11) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

(12) Obligation:

(13) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

(14) Obligation:

(15) CdtKnowledgeProof (EQUIVALENT transformation)

(16) BOUNDS(1, 1)