Runtime Complexity (innermost) proof of /tmp/tmpNWAzmI/15.xml

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

0 CpxTRS

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

↳2 CdtProblem

↳3 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID), 0 ms)

↳4 CdtProblem

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

↳6 CdtProblem

↳7 CdtUsableRulesProof (⇔, 0 ms)

↳8 CdtProblem

↳9 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 173 ms)

↳10 CdtProblem

↳11 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳12 CdtProblem

↳13 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 3 ms)

↳14 CdtProblem

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

↳16 CdtProblem

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

↳18 CdtProblem

↳19 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 31 ms)

↳20 CdtProblem

↳21 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳22 CdtProblem

↳23 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳24 CdtProblem

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

↳26 CdtProblem

↳27 CdtGraphSplitRhsProof (BOTH BOUNDS(ID, ID), 0 ms)

↳28 CdtProblem

↳29 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)

↳30 CdtProblem

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

↳32 CdtProblem

↳33 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 26 ms)

↳34 CdtProblem

↳35 CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)), 1608 ms)

↳36 CdtProblem

↳37 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳38 CdtProblem

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

↳40 CdtProblem

↳41 CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)), 1695 ms)

↳42 CdtProblem

↳43 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 2 ms)

↳44 CdtProblem

↳45 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳46 CdtProblem

↳47 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 31 ms)

↳48 CdtProblem

↳49 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳50 CdtProblem

↳51 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳52 CdtProblem

↳53 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID), 0 ms)

↳54 CdtProblem

↳55 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳56 CdtProblem

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

↳58 CdtProblem

↳59 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳60 CdtProblem

↳61 CdtGraphSplitRhsProof (BOTH BOUNDS(ID, ID), 0 ms)

↳62 CdtProblem

↳63 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)

↳64 CdtProblem

↳65 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳66 CdtProblem

↳67 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID), 0 ms)

↳68 CdtProblem

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

↳70 CdtProblem

↳71 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 28 ms)

↳72 CdtProblem

↳73 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳74 CdtProblem

↳75 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳76 CdtProblem

↳77 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳78 CdtProblem

↳79 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)

↳80 CdtProblem

↳81 CdtRewritingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳82 CdtProblem

↳83 CdtRewritingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳84 CdtProblem

↳85 CdtRewritingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳86 CdtProblem

↳87 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 27 ms)

↳88 CdtProblem

↳89 CdtRewritingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳90 CdtProblem

↳91 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 14 ms)

↳92 CdtProblem

↳93 CdtRewritingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳94 CdtProblem

↳95 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 17 ms)

↳96 CdtProblem

↳97 CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)), 2603 ms)

↳98 CdtProblem

↳99 CdtRewritingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳100 CdtProblem

↳101 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)

↳102 CdtProblem

↳103 CdtInstantiationProof (BOTH BOUNDS(ID, ID), 0 ms)

↳104 CdtProblem

↳105 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)

↳106 CdtProblem

↳107 CdtGraphSplitRhsProof (BOTH BOUNDS(ID, ID), 0 ms)

↳108 CdtProblem

↳109 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)

↳110 CdtProblem

↳111 CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)), 3822 ms)

↳112 CdtProblem

↳113 CdtRewritingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳114 CdtProblem

↳115 CdtInstantiationProof (BOTH BOUNDS(ID, ID), 0 ms)

↳116 CdtProblem

↳117 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)

↳118 CdtProblem

↳119 CdtGraphSplitRhsProof (BOTH BOUNDS(ID, ID), 0 ms)

↳120 CdtProblem

↳121 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)

↳122 CdtProblem

↳123 CdtRewritingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳124 CdtProblem

↳125 CdtRewritingProof (BOTH BOUNDS(ID, ID), 1 ms)

↳126 CdtProblem

↳127 CdtLeafRemovalProof (ComplexityIfPolyImplication, 0 ms)

↳128 CdtProblem

↳129 CdtRewritingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳130 CdtProblem

↳131 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID), 0 ms)

↳132 CdtProblem

↳133 CdtRewritingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳134 CdtProblem

↳135 CdtRewritingProof (BOTH BOUNDS(ID, ID), 0 ms)

↳136 CdtProblem

↳137 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 21 ms)

↳138 CdtProblem

↳139 CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)), 3948 ms)

↳140 CdtProblem

↳141 CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)), 2602 ms)

↳142 CdtProblem

↳143 SIsEmptyProof (BOTH BOUNDS(ID, ID), 0 ms)

↳144 BOUNDS(1, 1)

(0) Obligation:

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

The TRS R consists of the following rules:

cond1(true, x, y) → cond2(gr(x, 0), x, y)
cond2(true, x, y) → cond1(gr(add(x, y), 0), p(x), y)
cond2(false, x, y) → cond3(gr(y, 0), x, y)
cond3(true, x, y) → cond1(gr(add(x, y), 0), x, p(y))
cond3(false, x, y) → cond1(gr(add(x, y), 0), x, y)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
add(0, x) → x
add(s(x), y) → s(add(x, y))
p(0) → 0
p(s(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:

cond1(true, z0, z1) → cond2(gr(z0, 0), z0, z1)
cond2(true, z0, z1) → cond1(gr(add(z0, z1), 0), p(z0), z1)
cond2(false, z0, z1) → cond3(gr(z1, 0), z0, z1)
cond3(true, z0, z1) → cond1(gr(add(z0, z1), 0), z0, p(z1))
cond3(false, z0, z1) → cond1(gr(add(z0, z1), 0), z0, z1)
gr(0, z0) → false
gr(s(z0), 0) → true
gr(s(z0), s(z1)) → gr(z0, z1)
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1), GR(z0, 0))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), GR(add(z0, z1), 0), ADD(z0, z1), P(z0))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1), GR(z1, 0))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), GR(add(z0, z1), 0), ADD(z0, z1), P(z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), GR(add(z0, z1), 0), ADD(z0, z1))
GR(0, z0) → c5
GR(s(z0), 0) → c6
GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(0, z0) → c8
ADD(s(z0), z1) → c9(ADD(z0, z1))
P(0) → c10
P(s(z0)) → c11

S tuples:

COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1), GR(z0, 0))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), GR(add(z0, z1), 0), ADD(z0, z1), P(z0))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1), GR(z1, 0))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), GR(add(z0, z1), 0), ADD(z0, z1), P(z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), GR(add(z0, z1), 0), ADD(z0, z1))
GR(0, z0) → c5
GR(s(z0), 0) → c6
GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(0, z0) → c8
ADD(s(z0), z1) → c9(ADD(z0, z1))
P(0) → c10
P(s(z0)) → c11

K tuples:none
Defined Rule Symbols:

cond1, cond2, cond3, gr, add, p

Defined Pair Symbols:

COND1, COND2, COND3, GR, ADD, P

Compound Symbols:

c, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11

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

Removed 5 trailing nodes:

GR(s(z0), 0) → c6
P(0) → c10
P(s(z0)) → c11
ADD(0, z0) → c8
GR(0, z0) → c5

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

cond1(true, z0, z1) → cond2(gr(z0, 0), z0, z1)
cond2(true, z0, z1) → cond1(gr(add(z0, z1), 0), p(z0), z1)
cond2(false, z0, z1) → cond3(gr(z1, 0), z0, z1)
cond3(true, z0, z1) → cond1(gr(add(z0, z1), 0), z0, p(z1))
cond3(false, z0, z1) → cond1(gr(add(z0, z1), 0), z0, z1)
gr(0, z0) → false
gr(s(z0), 0) → true
gr(s(z0), s(z1)) → gr(z0, z1)
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1), GR(z0, 0))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), GR(add(z0, z1), 0), ADD(z0, z1), P(z0))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1), GR(z1, 0))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), GR(add(z0, z1), 0), ADD(z0, z1), P(z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), GR(add(z0, z1), 0), ADD(z0, z1))
GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))

S tuples:

COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1), GR(z0, 0))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), GR(add(z0, z1), 0), ADD(z0, z1), P(z0))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1), GR(z1, 0))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), GR(add(z0, z1), 0), ADD(z0, z1), P(z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), GR(add(z0, z1), 0), ADD(z0, z1))
GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))

K tuples:none
Defined Rule Symbols:

cond1, cond2, cond3, gr, add, p

Defined Pair Symbols:

COND1, COND2, COND3, GR, ADD

Compound Symbols:

c, c1, c2, c3, c4, c7, c9

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

Removed 7 trailing tuple parts

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

cond1(true, z0, z1) → cond2(gr(z0, 0), z0, z1)
cond2(true, z0, z1) → cond1(gr(add(z0, z1), 0), p(z0), z1)
cond2(false, z0, z1) → cond3(gr(z1, 0), z0, z1)
cond3(true, z0, z1) → cond1(gr(add(z0, z1), 0), z0, p(z1))
cond3(false, z0, z1) → cond1(gr(add(z0, z1), 0), z0, z1)
gr(0, z0) → false
gr(s(z0), 0) → true
gr(s(z0), s(z1)) → gr(z0, z1)
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))

S tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))

K tuples:none
Defined Rule Symbols:

cond1, cond2, cond3, gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c2, c3, c4

(7) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

cond1(true, z0, z1) → cond2(gr(z0, 0), z0, z1)
cond2(true, z0, z1) → cond1(gr(add(z0, z1), 0), p(z0), z1)
cond2(false, z0, z1) → cond3(gr(z1, 0), z0, z1)
cond3(true, z0, z1) → cond1(gr(add(z0, z1), 0), z0, p(z1))
cond3(false, z0, z1) → cond1(gr(add(z0, z1), 0), z0, z1)
gr(s(z0), s(z1)) → gr(z0, z1)

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))

S tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))

K tuples:none
Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c2, c3, c4

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

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

GR(s(z0), s(z1)) → c7(GR(z0, z1))

We considered the (Usable) Rules:none
And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = 0
POL(COND2(x₁, x₂, x₃)) = 0
POL(COND3(x₁, x₂, x₃)) = 0
POL(GR(x₁, x₂)) = x₁
POL(add(x₁, x₂)) = 0
POL(c(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c4(x₁, x₂)) = x₁ + x₂
POL(c7(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = 0
POL(gr(x₁, x₂)) = 0
POL(p(x₁)) = 0
POL(s(x₁)) = [2] + x₁
POL(true) = 0

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c2, c3, c4

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

Use narrowing to replace COND1(true, z0, z1) → c(COND2(gr(z0, 0), z0, z1)) by

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND2, COND3, COND1

Compound Symbols:

c7, c9, c1, c2, c3, c4, c

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

Use narrowing to replace COND2(true, z0, z1) → c1(COND1(gr(add(z0, z1), 0), p(z0), z1), ADD(z0, z1)) by

COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1), ADD(0, x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0), ADD(0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1), ADD(0, x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0), ADD(0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1), ADD(0, x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0), ADD(0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND2, COND3, COND1

Compound Symbols:

c7, c9, c2, c3, c4, c, c1

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

Removed 2 trailing tuple parts

(16) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND2, COND3, COND1

Compound Symbols:

c7, c9, c2, c3, c4, c, c1, c1

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

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

COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))

(18) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND2, COND3, COND1

Compound Symbols:

c7, c9, c2, c3, c4, c, c1, 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.

COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))

We considered the (Usable) Rules:

p(0) → 0
p(s(z0)) → z0

And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = x₂
POL(COND2(x₁, x₂, x₃)) = x₂
POL(COND3(x₁, x₂, x₃)) = x₂
POL(GR(x₁, x₂)) = x₂
POL(add(x₁, x₂)) = x₁ + x₂
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c4(x₁, x₂)) = x₁ + x₂
POL(c7(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = 0
POL(gr(x₁, x₂)) = 0
POL(p(x₁)) = x₁
POL(s(x₁)) = [1] + x₁
POL(true) = 0

(20) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND2, COND3, COND1

Compound Symbols:

c7, c9, c2, c3, c4, c, c1, c1

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

Use narrowing to replace COND2(false, z0, z1) → c2(COND3(gr(z1, 0), z0, z1)) by

COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))

(22) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND3, COND1, COND2

Compound Symbols:

c7, c9, c3, c4, c, c1, c1, c2

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

Use narrowing to replace COND3(true, z0, z1) → c3(COND1(gr(add(z0, z1), 0), z0, p(z1)), ADD(z0, z1)) by

COND3(true, x0, 0) → c3(COND1(gr(add(x0, 0), 0), x0, 0), ADD(x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)), ADD(0, z0))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))

(24) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, 0) → c3(COND1(gr(add(x0, 0), 0), x0, 0), ADD(x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)), ADD(0, z0))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, 0) → c3(COND1(gr(add(x0, 0), 0), x0, 0), ADD(x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)), ADD(0, z0))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND3, COND1, COND2

Compound Symbols:

c7, c9, c4, c, c1, c1, c2, c3

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

Removed 1 trailing tuple parts

(26) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, 0) → c3(COND1(gr(add(x0, 0), 0), x0, 0), ADD(x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, 0) → c3(COND1(gr(add(x0, 0), 0), x0, 0), ADD(x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND3, COND1, COND2

Compound Symbols:

c7, c9, c4, c, c1, c1, c2, c3, c3

(27) CdtGraphSplitRhsProof (BOTH BOUNDS(ID, ID) transformation)

Split RHS of tuples not part of any SCC

(28) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, 0) → c5(ADD(x0, 0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, 0) → c5(ADD(x0, 0))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND3, COND1, COND2

Compound Symbols:

c7, c9, c4, c, c1, c1, c2, c3, c3, c5

(29) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 1 leading nodes:

COND3(true, x0, 0) → c5(ADD(x0, 0))

(30) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND3, COND1, COND2

Compound Symbols:

c7, c9, c4, c, c1, c1, c2, c3, c3, c5

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

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

COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))

(32) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND3, COND1, COND2

Compound Symbols:

c7, c9, c4, c, c1, c1, c2, c3, c3, c5

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

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

COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))

We considered the (Usable) Rules:

p(0) → 0
p(s(z0)) → z0

And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = x₃
POL(COND2(x₁, x₂, x₃)) = x₃
POL(COND3(x₁, x₂, x₃)) = x₃
POL(GR(x₁, x₂)) = x₁
POL(add(x₁, x₂)) = 0
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c4(x₁, x₂)) = x₁ + x₂
POL(c5(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = 0
POL(gr(x₁, x₂)) = [1]
POL(p(x₁)) = x₁
POL(s(x₁)) = [1] + x₁
POL(true) = 0

(34) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND3, COND1, COND2

Compound Symbols:

c7, c9, c4, c, c1, c1, c2, c3, c3, c5

(35) CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)) transformation)

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

COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))

We considered the (Usable) Rules:none
And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = 0
POL(COND2(x₁, x₂, x₃)) = [2]x₁·x₂
POL(COND3(x₁, x₂, x₃)) = [2]x₂ + x₁·x₂
POL(GR(x₁, x₂)) = 0
POL(add(x₁, x₂)) = [2] + [2]x₂ + [2]x₂²
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c4(x₁, x₂)) = x₁ + x₂
POL(c5(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = [2]
POL(gr(x₁, x₂)) = x₁·x₂
POL(p(x₁)) = [2]
POL(s(x₁)) = [2]
POL(true) = 0

(36) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND3, COND1, COND2

Compound Symbols:

c7, c9, c4, c, c1, c1, c2, c3, c3, c5

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

Use narrowing to replace COND3(false, z0, z1) → c4(COND1(gr(add(z0, z1), 0), z0, z1), ADD(z0, z1)) by

COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0), ADD(0, z0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))

(38) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0), ADD(0, z0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0), ADD(0, z0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c1, c2, c3, c3, c5, c4

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

Removed 1 trailing tuple parts

(40) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c1, c2, c3, c3, c5, c4, c4

(41) CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)) transformation)

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

COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))

We considered the (Usable) Rules:none
And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = 0
POL(COND2(x₁, x₂, x₃)) = x₁·x₂
POL(COND3(x₁, x₂, x₃)) = x₂
POL(GR(x₁, x₂)) = 0
POL(add(x₁, x₂)) = x₁ + x₂ + [2]x₂² + x₁·x₂ + [2]x₁²
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c4(x₁)) = x₁
POL(c4(x₁, x₂)) = x₁ + x₂
POL(c5(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = [1]
POL(gr(x₁, x₂)) = x₂² + [2]x₁²
POL(p(x₁)) = [2]x₁²
POL(s(x₁)) = [2]
POL(true) = 0

(42) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c1, c2, c3, c3, c5, c4, c4

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

Use narrowing to replace COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1)) by

COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

(44) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c1, c2, c3, c3, c5, c4, c4

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

Use narrowing to replace COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), p(s(z0)), z1), ADD(s(z0), z1)) by

COND2(true, s(z0), x1) → c1(COND1(gr(s(add(z0, x1)), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

(46) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), x1) → c1(COND1(gr(s(add(z0, x1)), 0), z0, x1), ADD(s(z0), x1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c2, c3, c3, c5, c4, c4, c1

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

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

COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

We considered the (Usable) Rules:

p(0) → 0
p(s(z0)) → z0

And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = x₂
POL(COND2(x₁, x₂, x₃)) = x₂
POL(COND3(x₁, x₂, x₃)) = x₂
POL(GR(x₁, x₂)) = 0
POL(add(x₁, x₂)) = 0
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c4(x₁)) = x₁
POL(c4(x₁, x₂)) = x₁ + x₂
POL(c5(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = 0
POL(gr(x₁, x₂)) = 0
POL(p(x₁)) = x₁
POL(s(x₁)) = [1] + x₁
POL(true) = 0

(48) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c2, c3, c3, c5, c4, c4, c1

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

Use narrowing to replace COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1)) by

COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))

(50) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c2, c3, c3, c5, c4, c4, c1

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

Use narrowing to replace COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0)) by

COND2(true, 0, x0) → c1(COND1(gr(x0, 0), 0, x0))
COND2(true, 0, 0) → c1(COND1(false, p(0), 0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))

(52) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, 0) → c1(COND1(false, p(0), 0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, 0, x1) → c1(COND1(gr(add(0, x1), 0), 0, x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), p(0), z0))
COND2(true, s(z0), x1) → c1(COND1(gr(add(s(z0), x1), 0), z0, x1), ADD(s(z0), x1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c3, c3, c5, c4, c4, c1, c1

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

Removed 1 trailing nodes:

COND2(true, 0, 0) → c1(COND1(false, p(0), 0))

(54) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c3, c3, c5, c4, c4, c1, c1

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

Use narrowing to replace COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0))) by

COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1), ADD(0, s(x1)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))

(56) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1), ADD(0, s(x1)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c3, c3, c5, c4, c4, c1, c1

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

Removed 1 trailing tuple parts

(58) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c3, c3, c5, c4, c4, c1, c1

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

Use narrowing to replace COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1)) by

COND3(true, s(x0), 0) → c3(COND1(gr(s(add(x0, 0)), 0), s(x0), 0), ADD(s(x0), 0))
COND3(true, s(x0), s(z0)) → c3(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0), ADD(s(x0), s(z0)))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))

(60) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), 0) → c3(COND1(gr(s(add(x0, 0)), 0), s(x0), 0), ADD(s(x0), 0))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c3, c5, c4, c4, c1, c1, c3

(61) CdtGraphSplitRhsProof (BOTH BOUNDS(ID, ID) transformation)

Split RHS of tuples not part of any SCC

(62) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, s(x0), 0) → c6(ADD(s(x0), 0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(true, x0, s(z0)) → c3(COND1(gr(add(x0, s(z0)), 0), x0, z0), ADD(x0, s(z0)))
COND3(true, s(z0), z1) → c3(COND1(gr(s(add(z0, z1)), 0), s(z0), p(z1)), ADD(s(z0), z1))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c3, c5, c4, c4, c1, c1, c3, c6

(63) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 1 leading nodes:

COND3(true, s(x0), 0) → c6(ADD(s(x0), 0))

(64) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c3, c5, c4, c4, c1, c1, c3, c6

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

Use narrowing to replace COND3(true, 0, z0) → c3(COND1(gr(z0, 0), 0, p(z0))) by

COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(gr(s(z0), 0), 0, z0))
COND3(true, 0, 0) → c3(COND1(false, 0, p(0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

(66) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, 0) → c3(COND1(false, 0, p(0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(gr(s(z0), 0), 0, z0))
COND3(true, 0, 0) → c3(COND1(false, 0, p(0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c5, c4, c4, c1, c1, c3, c3, c6

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

Removed 1 trailing nodes:

COND3(true, 0, 0) → c3(COND1(false, 0, p(0)))

(68) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(gr(s(z0), 0), 0, z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c5, c4, c4, c1, c1, c3, c3, c6

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

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

COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))

(70) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(gr(s(z0), 0), 0, z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c5, c4, c4, c1, c1, c3, c3, c6

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

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

COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))

We considered the (Usable) Rules:

p(0) → 0
p(s(z0)) → z0

And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = x₃
POL(COND2(x₁, x₂, x₃)) = x₃
POL(COND3(x₁, x₂, x₃)) = x₃
POL(GR(x₁, x₂)) = 0
POL(add(x₁, x₂)) = 0
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c4(x₁)) = x₁
POL(c4(x₁, x₂)) = x₁ + x₂
POL(c5(x₁)) = x₁
POL(c6(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = 0
POL(gr(x₁, x₂)) = 0
POL(p(x₁)) = x₁
POL(s(x₁)) = [1] + x₁
POL(true) = 0

(72) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c5, c4, c4, c1, c1, c3, c3, c6

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

Use narrowing to replace COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0)) by

COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))

(74) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c4, c4, c1, c1, c3, c3, c6, c5

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

Use narrowing to replace COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1)) by

COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))

(76) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c4, c1, c1, c3, c3, c6, c5, c4

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

Use narrowing to replace COND3(false, 0, z0) → c4(COND1(gr(z0, 0), 0, z0)) by

COND3(false, 0, 0) → c4(COND1(false, 0, 0))
COND3(false, 0, s(z0)) → c4(COND1(true, 0, s(z0)))

(78) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND3(false, 0, 0) → c4(COND1(false, 0, 0))
COND3(false, 0, s(z0)) → c4(COND1(true, 0, s(z0)))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(false, 0, 0) → c4(COND1(false, 0, 0))
COND3(false, 0, s(z0)) → c4(COND1(true, 0, s(z0)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, x0, 0) → c5(COND1(gr(add(x0, 0), 0), x0, 0))
COND3(false, s(z0), z1) → c4(COND1(gr(s(add(z0, z1)), 0), s(z0), z1), ADD(s(z0), z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c1, c3, c3, c6, c5, c4, c4

(79) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 1 leading nodes:

COND3(false, 0, s(z0)) → c4(COND1(true, 0, s(z0)))

Removed 1 trailing nodes:

COND3(false, 0, 0) → c4(COND1(false, 0, 0))

(80) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c1, c3, c3, c6, c5, c4, c4

(81) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1)) by COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

(82) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c1, c3, c3, c6, c5, c4, c4

(83) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND2(true, s(z0), x1) → c1(COND1(gr(s(add(z0, x1)), 0), z0, x1), ADD(s(z0), x1)) by COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

(84) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c1, c3, c3, c6, c5, c4, c4

(85) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND2(true, s(x0), x1) → c1(COND1(true, p(s(x0)), x1), ADD(s(x0), x1)) by COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

(86) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c1, c3, c3, c6, c5, c4, c4

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

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

COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

We considered the (Usable) Rules:

p(0) → 0
p(s(z0)) → z0

And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = x₂
POL(COND2(x₁, x₂, x₃)) = x₂
POL(COND3(x₁, x₂, x₃)) = x₂
POL(GR(x₁, x₂)) = x₁
POL(add(x₁, x₂)) = 0
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c4(x₁)) = x₁
POL(c4(x₁, x₂)) = x₁ + x₂
POL(c5(x₁)) = x₁
POL(c6(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = 0
POL(gr(x₁, x₂)) = 0
POL(p(x₁)) = x₁
POL(s(x₁)) = [1] + x₁
POL(true) = 0

(88) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c1, c3, c3, c6, c5, c4, c4

(89) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), p(s(0)), z0), ADD(s(0), z0)) by COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))

(90) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c1, c3, c3, c6, c5, c4, c4

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

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

COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))

We considered the (Usable) Rules:

p(0) → 0
p(s(z0)) → z0

And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = x₂
POL(COND2(x₁, x₂, x₃)) = x₂
POL(COND3(x₁, x₂, x₃)) = x₂
POL(GR(x₁, x₂)) = x₂
POL(add(x₁, x₂)) = [1] + x₁ + x₂
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c4(x₁)) = x₁
POL(c4(x₁, x₂)) = x₁ + x₂
POL(c5(x₁)) = x₁
POL(c6(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = 0
POL(gr(x₁, x₂)) = 0
POL(p(x₁)) = x₁
POL(s(x₁)) = [1] + x₁
POL(true) = 0

(92) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c1, c3, c3, c6, c5, c4, c4

(93) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), p(s(s(z0))), z1), ADD(s(s(z0)), z1)) by COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))

(94) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c3, c3, c6, c5, c4, c4, c1

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

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

COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))

We considered the (Usable) Rules:

p(0) → 0

And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = x₂
POL(COND2(x₁, x₂, x₃)) = x₂
POL(COND3(x₁, x₂, x₃)) = x₂
POL(GR(x₁, x₂)) = x₂
POL(add(x₁, x₂)) = 0
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c4(x₁)) = x₁
POL(c4(x₁, x₂)) = x₁ + x₂
POL(c5(x₁)) = x₁
POL(c6(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = 0
POL(gr(x₁, x₂)) = 0
POL(p(x₁)) = 0
POL(s(x₁)) = [1] + x₁
POL(true) = 0

(96) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))

S tuples:

ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c3, c3, c6, c5, c4, c4, c1

(97) CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)) transformation)

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

ADD(s(z0), z1) → c9(ADD(z0, z1))

We considered the (Usable) Rules:

p(0) → 0

And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = x₁
POL(COND1(x₁, x₂, x₃)) = x₂²
POL(COND2(x₁, x₂, x₃)) = x₁·x₂ + x₂²
POL(COND3(x₁, x₂, x₃)) = x₂ + x₂²
POL(GR(x₁, x₂)) = x₂ + [2]x₂² + x₁²
POL(add(x₁, x₂)) = [2]x₁ + [2]x₁·x₂ + [2]x₁²
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c4(x₁)) = x₁
POL(c4(x₁, x₂)) = x₁ + x₂
POL(c5(x₁)) = x₁
POL(c6(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = [1]
POL(gr(x₁, x₂)) = x₂ + [2]x₁·x₂ + x₁²
POL(p(x₁)) = 0
POL(s(x₁)) = [2] + x₁
POL(true) = 0

(98) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0)))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c3, c3, c6, c5, c4, c4, c1

(99) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND2(true, 0, s(z0)) → c1(COND1(true, p(0), s(z0))) by COND2(true, 0, s(z0)) → c1(COND1(true, 0, s(z0)))

(100) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND2(true, 0, s(z0)) → c1(COND1(true, 0, s(z0)))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND2(true, s(z0), z1) → c1(COND1(gr(s(add(z0, z1)), 0), z0, z1), ADD(s(z0), z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c3, c3, c6, c5, c4, c4, c1

(101) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 1 leading nodes:

COND2(true, 0, s(z0)) → c1(COND1(true, 0, s(z0)))

(102) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, 0) → c2(COND3(false, x0, 0))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c3, c3, c6, c5, c4, c4, c1

(103) CdtInstantiationProof (BOTH BOUNDS(ID, ID) transformation)

Use instantiation to replace COND2(false, x0, 0) → c2(COND3(false, x0, 0)) by

COND2(false, 0, 0) → c2(COND3(false, 0, 0))

(104) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND2(false, 0, 0) → c2(COND3(false, 0, 0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(false, 0, 0) → c2(COND3(false, 0, 0))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c3, c3, c6, c5, c4, c4, c1

(105) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 2 leading nodes:

COND3(false, s(x0), x1) → c4(COND1(true, s(x0), x1), ADD(s(x0), x1))
COND3(false, s(x0), x1) → c4(ADD(s(x0), x1))

Removed 1 trailing nodes:

COND2(false, 0, 0) → c2(COND3(false, 0, 0))

(106) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND3(false, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), z0), ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1), ADD(s(s(z0)), z1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c3, c3, c6, c5, c4, c1

(107) CdtGraphSplitRhsProof (BOTH BOUNDS(ID, ID) transformation)

Split RHS of tuples not part of any SCC

(108) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(0), z0) → c8(ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND3(false, s(s(z0)), z1) → c8(ADD(s(s(z0)), z1))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c3, c3, c6, c5, c1, c8

(109) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 2 leading nodes:

COND3(false, s(0), z0) → c8(ADD(s(0), z0))
COND3(false, s(s(z0)), z1) → c8(ADD(s(s(z0)), z1))

(110) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c3, c3, c6, c5, c1, c8

(111) CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)) transformation)

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

COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))

We considered the (Usable) Rules:none
And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = x₂ + [2]x₂²
POL(COND2(x₁, x₂, x₃)) = [2]x₁·x₂ + [2]x₂²
POL(COND3(x₁, x₂, x₃)) = x₂ + [2]x₂²
POL(GR(x₁, x₂)) = [2]x₁ + [2]x₁²
POL(add(x₁, x₂)) = [2]x₂ + x₂² + [2]x₁·x₂
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c3(x₁, x₂)) = x₁ + x₂
POL(c5(x₁)) = x₁
POL(c6(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c8(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = [1]
POL(gr(x₁, x₂)) = [2]x₂ + [2]x₂² + [2]x₁·x₂
POL(p(x₁)) = [2]
POL(s(x₁)) = [2] + x₁
POL(true) = 0

(112) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c3, c3, c6, c5, c1, c8

(113) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1))) by COND3(true, s(z0), s(z1)) → c3(COND1(true, s(z0), z1), ADD(s(z0), s(z1)))

(114) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND3(true, s(z0), s(z1)) → c3(COND1(true, s(z0), z1), ADD(s(z0), s(z1)))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c2, c1, c3, c3, c6, c5, c1, c8

(115) CdtInstantiationProof (BOTH BOUNDS(ID, ID) transformation)

Use instantiation to replace COND2(false, x0, s(z0)) → c2(COND3(true, x0, s(z0))) by

COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

(116) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, s(z0), s(x1)) → c3(COND1(gr(s(add(z0, s(x1))), 0), s(z0), x1), ADD(s(z0), s(x1)))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND3(true, s(z0), s(z1)) → c3(COND1(true, s(z0), z1), ADD(s(z0), s(z1)))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c3, c3, c6, c5, c1, c8, c2

(117) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 2 leading nodes:

COND3(true, s(x0), x1) → c3(ADD(s(x0), x1))
COND3(true, s(z0), s(z1)) → c3(COND1(true, s(z0), z1), ADD(s(z0), s(z1)))

(118) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), s(z0)) → c3(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0), ADD(s(x0), s(z0)))
COND3(true, s(x0), x1) → c3(COND1(true, s(x0), p(x1)), ADD(s(x0), x1))
COND3(true, s(0), z0) → c3(COND1(gr(s(z0), 0), s(0), p(z0)), ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c3(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)), ADD(s(s(z0)), z1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(0), z0) → c1(COND1(gr(s(z0), 0), 0, z0), ADD(s(0), z0))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c3, c3, c6, c5, c1, c8, c2

(119) CdtGraphSplitRhsProof (BOTH BOUNDS(ID, ID) transformation)

Split RHS of tuples not part of any SCC

(120) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), s(z0)) → c4(ADD(s(x0), s(z0)))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(x0), x1) → c4(ADD(s(x0), x1))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND3(true, s(s(z0)), z1) → c4(ADD(s(s(z0)), z1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c3, c6, c5, c1, c8, c2, c4

(121) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 4 leading nodes:

COND3(true, s(x0), s(z0)) → c4(ADD(s(x0), s(z0)))
COND3(true, s(x0), x1) → c4(ADD(s(x0), x1))
COND3(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, s(s(z0)), z1) → c4(ADD(s(s(z0)), z1))

(122) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c3, c6, c5, c1, c8, c2, c4

(123) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1)) by COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

(124) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c3, c6, c5, c1, c8, c2, c4

(125) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND3(true, s(x0), 0) → c6(COND1(gr(s(add(x0, 0)), 0), s(x0), 0)) by COND3(true, s(z0), 0) → c6(COND1(true, s(z0), 0))

(126) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))
COND3(true, s(z0), 0) → c6(COND1(true, s(z0), 0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c3, c5, c1, c8, c2, c4, c6

(127) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 1 leading nodes:

COND3(true, s(z0), 0) → c6(COND1(true, s(z0), 0))

(128) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(z0)) → c3(COND1(gr(s(z0), 0), 0, z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c3, c5, c1, c8, c2, c4

(129) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0)) by COND3(true, 0, 0) → c3(COND1(false, 0, 0))

(130) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, s(z0)) → c3(COND1(gr(s(z0), 0), 0, z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))
COND3(true, 0, 0) → c3(COND1(false, 0, 0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, 0) → c3(COND1(gr(0, 0), 0, 0))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c3, c5, c1, c8, c2, c4

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

Removed 1 trailing nodes:

COND3(true, 0, 0) → c3(COND1(false, 0, 0))

(132) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, s(z0)) → c3(COND1(gr(s(z0), 0), 0, z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c3, c5, c1, c8, c2, c4

(133) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND3(true, 0, s(z0)) → c3(COND1(gr(s(z0), 0), 0, z0)) by COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

(134) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0))))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c3, c5, c1, c8, c2, c4

(135) CdtRewritingProof (BOTH BOUNDS(ID, ID) transformation)

Used rewriting to replace COND3(true, 0, s(z0)) → c3(COND1(true, 0, p(s(z0)))) by COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

(136) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c5, c1, c8, c2, c4, c3

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

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

COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

We considered the (Usable) Rules:

p(0) → 0
p(s(z0)) → z0

And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = x₃
POL(COND2(x₁, x₂, x₃)) = x₃
POL(COND3(x₁, x₂, x₃)) = x₃
POL(GR(x₁, x₂)) = 0
POL(add(x₁, x₂)) = 0
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c4(x₁)) = x₁
POL(c5(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c8(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = 0
POL(gr(x₁, x₂)) = [1]
POL(p(x₁)) = x₁
POL(s(x₁)) = [1] + x₁
POL(true) = [1]

(138) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c5, c1, c8, c2, c4, c3

(139) CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)) transformation)

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

COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

We considered the (Usable) Rules:

p(0) → 0
p(s(z0)) → z0

And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = 0
POL(COND1(x₁, x₂, x₃)) = [2]x₃ + x₃²
POL(COND2(x₁, x₂, x₃)) = [2]x₃ + x₃²
POL(COND3(x₁, x₂, x₃)) = x₁ + x₂ + x₃² + [2]x₂·x₃ + [2]x₁·x₂ + x₂²
POL(GR(x₁, x₂)) = [2]x₂ + x₁·x₂ + x₁²
POL(add(x₁, x₂)) = [2]x₂² + x₁²
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c4(x₁)) = x₁
POL(c5(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c8(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = 0
POL(gr(x₁, x₂)) = 0
POL(p(x₁)) = [1] + x₁
POL(s(x₁)) = [2] + x₁
POL(true) = 0

(140) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

S tuples:

COND1(true, 0, x1) → c(COND2(false, 0, x1))

K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c5, c1, c8, c2, c4, c3

(141) CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)) transformation)

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

COND1(true, 0, x1) → c(COND2(false, 0, x1))

We considered the (Usable) Rules:

p(0) → 0
p(s(z0)) → z0

And the Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

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

POL(0) = 0
POL(ADD(x₁, x₂)) = [1]
POL(COND1(x₁, x₂, x₃)) = [1] + [2]x₂ + x₃ + x₃² + [2]x₂²
POL(COND2(x₁, x₂, x₃)) = x₁ + x₃ + x₃² + [2]x₂²
POL(COND3(x₁, x₂, x₃)) = [1] + [2]x₂ + x₃² + [2]x₂·x₃ + [2]x₂²
POL(GR(x₁, x₂)) = [2]x₁ + [2]x₁·x₂
POL(add(x₁, x₂)) = [2]x₂² + [2]x₁²
POL(c(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(c1(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c3(x₁)) = x₁
POL(c4(x₁)) = x₁
POL(c5(x₁)) = x₁
POL(c7(x₁)) = x₁
POL(c8(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(false) = 0
POL(gr(x₁, x₂)) = 0
POL(p(x₁)) = x₁
POL(s(x₁)) = [1] + x₁
POL(true) = [2]

(142) Obligation:

Complexity Dependency Tuples Problem
Rules:

gr(0, z0) → false
gr(s(z0), 0) → true
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
p(0) → 0
p(s(z0)) → z0

Tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, 0, x1) → c(COND2(false, 0, x1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, 0, z0) → c1(COND1(gr(z0, 0), 0, z0))
COND3(true, 0, 0) → c5(COND1(gr(0, 0), 0, 0))
COND3(true, s(z0), 0) → c5(COND1(gr(s(add(z0, 0)), 0), s(z0), 0))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
COND3(false, s(0), z0) → c8(COND1(gr(s(z0), 0), s(0), z0))
COND3(false, s(s(z0)), z1) → c8(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), z1))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND3(true, s(x0), s(z0)) → c4(COND1(gr(s(add(x0, s(z0))), 0), s(x0), z0))
COND3(true, s(x0), x1) → c4(COND1(true, s(x0), p(x1)))
COND3(true, s(0), z0) → c4(COND1(gr(s(z0), 0), s(0), p(z0)))
COND3(true, s(s(z0)), z1) → c4(COND1(gr(s(s(add(z0, z1))), 0), s(s(z0)), p(z1)))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))

S tuples:none
K tuples:

GR(s(z0), s(z1)) → c7(GR(z0, z1))
COND3(true, 0, s(x1)) → c3(COND1(gr(s(x1), 0), 0, x1))
COND2(true, s(z0), z1) → c1(COND1(true, z0, z1), ADD(s(z0), z1))
COND2(true, s(s(z0)), z1) → c1(COND1(gr(s(s(add(z0, z1))), 0), s(z0), z1), ADD(s(s(z0)), z1))
ADD(s(z0), z1) → c9(ADD(z0, z1))
COND1(true, s(z0), x1) → c(COND2(true, s(z0), x1))
COND2(true, s(0), z0) → c4(COND1(gr(s(z0), 0), 0, z0))
COND2(true, s(0), z0) → c4(ADD(s(0), z0))
COND3(true, 0, s(z0)) → c3(COND1(true, 0, z0))
COND2(false, 0, s(z1)) → c2(COND3(true, 0, s(z1)))
COND1(true, 0, x1) → c(COND2(false, 0, x1))

Defined Rule Symbols:

gr, add, p

Defined Pair Symbols:

GR, ADD, COND1, COND2, COND3

Compound Symbols:

c7, c9, c, c1, c5, c1, c8, c2, c4, c3

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

The set S is empty