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

0 CpxTRS
↳1 RcToIrcProof (BOTH BOUNDS(ID, ID), 14 ms)
↳2 CpxTRS
↳3 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID), 0 ms)
↳4 CdtProblem
↳5 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID), 0 ms)
↳6 CdtProblem
↳7 CdtUsableRulesProof (⇔, 0 ms)
↳8 CdtProblem
↳9 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)
↳10 CdtProblem
↳11 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID), 0 ms)
↳12 CdtProblem
↳13 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID), 0 ms)
↳14 CdtProblem
↳15 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)
↳16 CdtProblem
↳17 CdtUsableRulesProof (⇔, 0 ms)
↳18 CdtProblem
↳19 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 0 ms)
↳20 CdtProblem
↳21 SIsEmptyProof (BOTH BOUNDS(ID, ID), 0 ms)
↳22 BOUNDS(1, 1)

(0) Obligation:

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


The TRS R consists of the following rules:

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

Rewrite Strategy: FULL

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

Converted rc-obligation to irc-obligation.

The duplicating contexts are:
f(0, s(0), [])

The defined contexts are:
f(x0, [], x2)

As the TRS is an overlay system and the defined contexts and the duplicating contexts don't overlap, we have rc = irc.

(2) Obligation:

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


The TRS R consists of the following rules:

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

Rewrite Strategy: INNERMOST

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

Converted Cpx (relative) TRS to CDT

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

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

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

+, f, g

Defined Pair Symbols:

+', F, G

Compound Symbols:

c, c1, c2, c3, c4

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

Removed 3 trailing nodes:

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

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

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

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

+, f, g

Defined Pair Symbols:

+', F

Compound Symbols:

c1, c2

(7) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

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

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

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

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

+

Defined Pair Symbols:

+', F

Compound Symbols:

c1, c2

(9) CdtNarrowingProof (BOTH BOUNDS(ID, ID) transformation)

Use narrowing to replace F(0, s(0), z0) → c2(F(z0, +(z0, z0), z0), +'(z0, z0)) by

F(0, s(0), 0) → c2(F(0, 0, 0), +'(0, 0))
F(0, s(0), s(z1)) → c2(F(s(z1), s(+(s(z1), z1)), s(z1)), +'(s(z1), s(z1)))

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

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

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

+

Defined Pair Symbols:

+', F

Compound Symbols:

c1, c2

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

Removed 1 trailing nodes:

F(0, s(0), 0) → c2(F(0, 0, 0), +'(0, 0))

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

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

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

+

Defined Pair Symbols:

+', F

Compound Symbols:

c1, c2

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

Removed 1 trailing tuple parts

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

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

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

+

Defined Pair Symbols:

+', F

Compound Symbols:

c1, c2

(15) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 1 leading nodes:

F(0, s(0), s(z1)) → c2(+'(s(z1), s(z1)))

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

(17) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

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

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

(19) CdtRuleRemovalProof (UPPER BOUND(ADD(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)) = x2   
POL(c1(x1)) = x1   
POL(s(x1)) = [1] + x1   

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

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

The set S is empty

(22) BOUNDS(1, 1)