Runtime Complexity (innermost) proof of /tmp/tmpSlaCkl/clevermmult.raml.xml

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

0 CpxRelTRS

↳1 CpxTrsToCdtProof (UPPER BOUND(ID), 0 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)), 430 ms)

↳10 CdtProblem

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

↳12 CdtProblem

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

↳14 CdtProblem

↳15 CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)), 823 ms)

↳16 CdtProblem

↳17 CdtKnowledgeProof (⇔, 0 ms)

↳18 BOUNDS(1, 1)

(0) Obligation:

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

*(@x, @y) → #mult(@x, @y)
+(@x, @y) → #add(@x, @y)
computeLine(@line, @m, @acc) → computeLine#1(@line, @acc, @m)
computeLine#1(::(@x, @xs), @acc, @m) → computeLine#2(@m, @acc, @x, @xs)
computeLine#1(nil, @acc, @m) → @acc
computeLine#2(::(@l, @ls), @acc, @x, @xs) → computeLine(@xs, @ls, lineMult(@x, @l, @acc))
computeLine#2(nil, @acc, @x, @xs) → nil
lineMult(@n, @l1, @l2) → lineMult#1(@l1, @l2, @n)
lineMult#1(::(@x, @xs), @l2, @n) → lineMult#2(@l2, @n, @x, @xs)
lineMult#1(nil, @l2, @n) → nil
lineMult#2(::(@y, @ys), @n, @x, @xs) → ::(+(*(@x, @n), @y), lineMult(@n, @xs, @ys))
lineMult#2(nil, @n, @x, @xs) → ::(*(@x, @n), lineMult(@n, @xs, nil))
matrixMult(@m1, @m2) → matrixMult#1(@m1, @m2)
matrixMult#1(::(@l, @ls), @m2) → ::(computeLine(@l, @m2, nil), matrixMult(@ls, @m2))
matrixMult#1(nil, @m2) → nil

The (relative) TRS S consists of the following rules:

#add(#0, @y) → @y
#add(#neg(#s(#0)), @y) → #pred(@y)
#add(#neg(#s(#s(@x))), @y) → #pred(#add(#pos(#s(@x)), @y))
#add(#pos(#s(#0)), @y) → #succ(@y)
#add(#pos(#s(#s(@x))), @y) → #succ(#add(#pos(#s(@x)), @y))
#mult(#0, #0) → #0
#mult(#0, #neg(@y)) → #0
#mult(#0, #pos(@y)) → #0
#mult(#neg(@x), #0) → #0
#mult(#neg(@x), #neg(@y)) → #pos(#natmult(@x, @y))
#mult(#neg(@x), #pos(@y)) → #neg(#natmult(@x, @y))
#mult(#pos(@x), #0) → #0
#mult(#pos(@x), #neg(@y)) → #neg(#natmult(@x, @y))
#mult(#pos(@x), #pos(@y)) → #pos(#natmult(@x, @y))
#natmult(#0, @y) → #0
#natmult(#s(@x), @y) → #add(#pos(@y), #natmult(@x, @y))
#pred(#0) → #neg(#s(#0))
#pred(#neg(#s(@x))) → #neg(#s(#s(@x)))
#pred(#pos(#s(#0))) → #0
#pred(#pos(#s(#s(@x)))) → #pos(#s(@x))
#succ(#0) → #pos(#s(#0))
#succ(#neg(#s(#0))) → #0
#succ(#neg(#s(#s(@x)))) → #neg(#s(@x))
#succ(#pos(#s(@x))) → #pos(#s(#s(@x)))

Rewrite Strategy: INNERMOST

(1) CpxTrsToCdtProof (UPPER BOUND(ID) transformation)

Converted Cpx (relative) TRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

#add(#0, z0) → z0
#add(#neg(#s(#0)), z0) → #pred(z0)
#add(#neg(#s(#s(z0))), z1) → #pred(#add(#pos(#s(z0)), z1))
#add(#pos(#s(#0)), z0) → #succ(z0)
#add(#pos(#s(#s(z0))), z1) → #succ(#add(#pos(#s(z0)), z1))
#mult(#0, #0) → #0
#mult(#0, #neg(z0)) → #0
#mult(#0, #pos(z0)) → #0
#mult(#neg(z0), #0) → #0
#mult(#neg(z0), #neg(z1)) → #pos(#natmult(z0, z1))
#mult(#neg(z0), #pos(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #0) → #0
#mult(#pos(z0), #neg(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #pos(z1)) → #pos(#natmult(z0, z1))
#natmult(#0, z0) → #0
#natmult(#s(z0), z1) → #add(#pos(z1), #natmult(z0, z1))
#pred(#0) → #neg(#s(#0))
#pred(#neg(#s(z0))) → #neg(#s(#s(z0)))
#pred(#pos(#s(#0))) → #0
#pred(#pos(#s(#s(z0)))) → #pos(#s(z0))
#succ(#0) → #pos(#s(#0))
#succ(#neg(#s(#0))) → #0
#succ(#neg(#s(#s(z0)))) → #neg(#s(z0))
#succ(#pos(#s(z0))) → #pos(#s(#s(z0)))
*(z0, z1) → #mult(z0, z1)
+(z0, z1) → #add(z0, z1)
computeLine(z0, z1, z2) → computeLine#1(z0, z2, z1)
computeLine#1(::(z0, z1), z2, z3) → computeLine#2(z3, z2, z0, z1)
computeLine#1(nil, z0, z1) → z0
computeLine#2(::(z0, z1), z2, z3, z4) → computeLine(z4, z1, lineMult(z3, z0, z2))
computeLine#2(nil, z0, z1, z2) → nil
lineMult(z0, z1, z2) → lineMult#1(z1, z2, z0)
lineMult#1(::(z0, z1), z2, z3) → lineMult#2(z2, z3, z0, z1)
lineMult#1(nil, z0, z1) → nil
lineMult#2(::(z0, z1), z2, z3, z4) → ::(+(*(z3, z2), z0), lineMult(z2, z4, z1))
lineMult#2(nil, z0, z1, z2) → ::(*(z1, z0), lineMult(z0, z2, nil))
matrixMult(z0, z1) → matrixMult#1(z0, z1)
matrixMult#1(::(z0, z1), z2) → ::(computeLine(z0, z2, nil), matrixMult(z1, z2))
matrixMult#1(nil, z0) → nil

Tuples:

#ADD(#0, z0) → c
#ADD(#neg(#s(#0)), z0) → c1(#PRED(z0))
#ADD(#neg(#s(#s(z0))), z1) → c2(#PRED(#add(#pos(#s(z0)), z1)), #ADD(#pos(#s(z0)), z1))
#ADD(#pos(#s(#0)), z0) → c3(#SUCC(z0))
#ADD(#pos(#s(#s(z0))), z1) → c4(#SUCC(#add(#pos(#s(z0)), z1)), #ADD(#pos(#s(z0)), z1))
#MULT(#0, #0) → c5
#MULT(#0, #neg(z0)) → c6
#MULT(#0, #pos(z0)) → c7
#MULT(#neg(z0), #0) → c8
#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #0) → c11
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#NATMULT(#0, z0) → c14
#NATMULT(#s(z0), z1) → c15(#ADD(#pos(z1), #natmult(z0, z1)), #NATMULT(z0, z1))
#PRED(#0) → c16
#PRED(#neg(#s(z0))) → c17
#PRED(#pos(#s(#0))) → c18
#PRED(#pos(#s(#s(z0)))) → c19
#SUCC(#0) → c20
#SUCC(#neg(#s(#0))) → c21
#SUCC(#neg(#s(#s(z0)))) → c22
#SUCC(#pos(#s(z0))) → c23
*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#1(nil, z0, z1) → c28
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
COMPUTELINE#2(nil, z0, z1, z2) → c30
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#1(nil, z0, z1) → c33
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
MATRIXMULT#1(nil, z0) → c38

S tuples:

*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#1(nil, z0, z1) → c28
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
COMPUTELINE#2(nil, z0, z1, z2) → c30
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#1(nil, z0, z1) → c33
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
MATRIXMULT#1(nil, z0) → c38

K tuples:none
Defined Rule Symbols:

*, +, computeLine, computeLine#1, computeLine#2, lineMult, lineMult#1, lineMult#2, matrixMult, matrixMult#1, #add, #mult, #natmult, #pred, #succ

Defined Pair Symbols:

#ADD, #MULT, #NATMULT, #PRED, #SUCC, *', +', COMPUTELINE, COMPUTELINE#1, COMPUTELINE#2, LINEMULT, LINEMULT#1, LINEMULT#2, MATRIXMULT, MATRIXMULT#1

Compound Symbols:

c, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19, c20, c21, c22, c23, c24, c25, c26, c27, c28, c29, c30, c31, c32, c33, c34, c35, c36, c37, c38

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

Removed 21 trailing nodes:

#MULT(#0, #0) → c5
#PRED(#neg(#s(z0))) → c17
#SUCC(#pos(#s(z0))) → c23
#NATMULT(#0, z0) → c14
COMPUTELINE#1(nil, z0, z1) → c28
#SUCC(#0) → c20
LINEMULT#1(nil, z0, z1) → c33
#PRED(#pos(#s(#s(z0)))) → c19
#MULT(#0, #neg(z0)) → c6
#ADD(#0, z0) → c
#SUCC(#neg(#s(#s(z0)))) → c22
#MULT(#pos(z0), #0) → c11
MATRIXMULT#1(nil, z0) → c38
#MULT(#neg(z0), #0) → c8
#MULT(#0, #pos(z0)) → c7
#PRED(#pos(#s(#0))) → c18
COMPUTELINE#2(nil, z0, z1, z2) → c30
#PRED(#0) → c16
#ADD(#neg(#s(#0)), z0) → c1(#PRED(z0))
#ADD(#pos(#s(#0)), z0) → c3(#SUCC(z0))
#SUCC(#neg(#s(#0))) → c21

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

#add(#0, z0) → z0
#add(#neg(#s(#0)), z0) → #pred(z0)
#add(#neg(#s(#s(z0))), z1) → #pred(#add(#pos(#s(z0)), z1))
#add(#pos(#s(#0)), z0) → #succ(z0)
#add(#pos(#s(#s(z0))), z1) → #succ(#add(#pos(#s(z0)), z1))
#mult(#0, #0) → #0
#mult(#0, #neg(z0)) → #0
#mult(#0, #pos(z0)) → #0
#mult(#neg(z0), #0) → #0
#mult(#neg(z0), #neg(z1)) → #pos(#natmult(z0, z1))
#mult(#neg(z0), #pos(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #0) → #0
#mult(#pos(z0), #neg(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #pos(z1)) → #pos(#natmult(z0, z1))
#natmult(#0, z0) → #0
#natmult(#s(z0), z1) → #add(#pos(z1), #natmult(z0, z1))
#pred(#0) → #neg(#s(#0))
#pred(#neg(#s(z0))) → #neg(#s(#s(z0)))
#pred(#pos(#s(#0))) → #0
#pred(#pos(#s(#s(z0)))) → #pos(#s(z0))
#succ(#0) → #pos(#s(#0))
#succ(#neg(#s(#0))) → #0
#succ(#neg(#s(#s(z0)))) → #neg(#s(z0))
#succ(#pos(#s(z0))) → #pos(#s(#s(z0)))
*(z0, z1) → #mult(z0, z1)
+(z0, z1) → #add(z0, z1)
computeLine(z0, z1, z2) → computeLine#1(z0, z2, z1)
computeLine#1(::(z0, z1), z2, z3) → computeLine#2(z3, z2, z0, z1)
computeLine#1(nil, z0, z1) → z0
computeLine#2(::(z0, z1), z2, z3, z4) → computeLine(z4, z1, lineMult(z3, z0, z2))
computeLine#2(nil, z0, z1, z2) → nil
lineMult(z0, z1, z2) → lineMult#1(z1, z2, z0)
lineMult#1(::(z0, z1), z2, z3) → lineMult#2(z2, z3, z0, z1)
lineMult#1(nil, z0, z1) → nil
lineMult#2(::(z0, z1), z2, z3, z4) → ::(+(*(z3, z2), z0), lineMult(z2, z4, z1))
lineMult#2(nil, z0, z1, z2) → ::(*(z1, z0), lineMult(z0, z2, nil))
matrixMult(z0, z1) → matrixMult#1(z0, z1)
matrixMult#1(::(z0, z1), z2) → ::(computeLine(z0, z2, nil), matrixMult(z1, z2))
matrixMult#1(nil, z0) → nil

Tuples:

#ADD(#neg(#s(#s(z0))), z1) → c2(#PRED(#add(#pos(#s(z0)), z1)), #ADD(#pos(#s(z0)), z1))
#ADD(#pos(#s(#s(z0))), z1) → c4(#SUCC(#add(#pos(#s(z0)), z1)), #ADD(#pos(#s(z0)), z1))
#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#NATMULT(#s(z0), z1) → c15(#ADD(#pos(z1), #natmult(z0, z1)), #NATMULT(z0, z1))
*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))

S tuples:

*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))

K tuples:none
Defined Rule Symbols:

*, +, computeLine, computeLine#1, computeLine#2, lineMult, lineMult#1, lineMult#2, matrixMult, matrixMult#1, #add, #mult, #natmult, #pred, #succ

Defined Pair Symbols:

#ADD, #MULT, #NATMULT, *', +', COMPUTELINE, COMPUTELINE#1, COMPUTELINE#2, LINEMULT, LINEMULT#1, LINEMULT#2, MATRIXMULT, MATRIXMULT#1

Compound Symbols:

c2, c4, c9, c10, c12, c13, c15, c24, c25, c26, c27, c29, c31, c32, c34, c35, c36, c37

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

Removed 2 trailing tuple parts

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

#add(#0, z0) → z0
#add(#neg(#s(#0)), z0) → #pred(z0)
#add(#neg(#s(#s(z0))), z1) → #pred(#add(#pos(#s(z0)), z1))
#add(#pos(#s(#0)), z0) → #succ(z0)
#add(#pos(#s(#s(z0))), z1) → #succ(#add(#pos(#s(z0)), z1))
#mult(#0, #0) → #0
#mult(#0, #neg(z0)) → #0
#mult(#0, #pos(z0)) → #0
#mult(#neg(z0), #0) → #0
#mult(#neg(z0), #neg(z1)) → #pos(#natmult(z0, z1))
#mult(#neg(z0), #pos(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #0) → #0
#mult(#pos(z0), #neg(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #pos(z1)) → #pos(#natmult(z0, z1))
#natmult(#0, z0) → #0
#natmult(#s(z0), z1) → #add(#pos(z1), #natmult(z0, z1))
#pred(#0) → #neg(#s(#0))
#pred(#neg(#s(z0))) → #neg(#s(#s(z0)))
#pred(#pos(#s(#0))) → #0
#pred(#pos(#s(#s(z0)))) → #pos(#s(z0))
#succ(#0) → #pos(#s(#0))
#succ(#neg(#s(#0))) → #0
#succ(#neg(#s(#s(z0)))) → #neg(#s(z0))
#succ(#pos(#s(z0))) → #pos(#s(#s(z0)))
*(z0, z1) → #mult(z0, z1)
+(z0, z1) → #add(z0, z1)
computeLine(z0, z1, z2) → computeLine#1(z0, z2, z1)
computeLine#1(::(z0, z1), z2, z3) → computeLine#2(z3, z2, z0, z1)
computeLine#1(nil, z0, z1) → z0
computeLine#2(::(z0, z1), z2, z3, z4) → computeLine(z4, z1, lineMult(z3, z0, z2))
computeLine#2(nil, z0, z1, z2) → nil
lineMult(z0, z1, z2) → lineMult#1(z1, z2, z0)
lineMult#1(::(z0, z1), z2, z3) → lineMult#2(z2, z3, z0, z1)
lineMult#1(nil, z0, z1) → nil
lineMult#2(::(z0, z1), z2, z3, z4) → ::(+(*(z3, z2), z0), lineMult(z2, z4, z1))
lineMult#2(nil, z0, z1, z2) → ::(*(z1, z0), lineMult(z0, z2, nil))
matrixMult(z0, z1) → matrixMult#1(z0, z1)
matrixMult#1(::(z0, z1), z2) → ::(computeLine(z0, z2, nil), matrixMult(z1, z2))
matrixMult#1(nil, z0) → nil

Tuples:

#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#NATMULT(#s(z0), z1) → c15(#ADD(#pos(z1), #natmult(z0, z1)), #NATMULT(z0, z1))
*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
#ADD(#neg(#s(#s(z0))), z1) → c2(#ADD(#pos(#s(z0)), z1))
#ADD(#pos(#s(#s(z0))), z1) → c4(#ADD(#pos(#s(z0)), z1))

S tuples:

*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))

K tuples:none
Defined Rule Symbols:

*, +, computeLine, computeLine#1, computeLine#2, lineMult, lineMult#1, lineMult#2, matrixMult, matrixMult#1, #add, #mult, #natmult, #pred, #succ

Defined Pair Symbols:

#MULT, #NATMULT, *', +', COMPUTELINE, COMPUTELINE#1, COMPUTELINE#2, LINEMULT, LINEMULT#1, LINEMULT#2, MATRIXMULT, MATRIXMULT#1, #ADD

Compound Symbols:

c9, c10, c12, c13, c15, c24, c25, c26, c27, c29, c31, c32, c34, c35, c36, c37, c2, c4

(7) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

computeLine(z0, z1, z2) → computeLine#1(z0, z2, z1)
computeLine#1(::(z0, z1), z2, z3) → computeLine#2(z3, z2, z0, z1)
computeLine#1(nil, z0, z1) → z0
computeLine#2(::(z0, z1), z2, z3, z4) → computeLine(z4, z1, lineMult(z3, z0, z2))
computeLine#2(nil, z0, z1, z2) → nil
matrixMult(z0, z1) → matrixMult#1(z0, z1)
matrixMult#1(::(z0, z1), z2) → ::(computeLine(z0, z2, nil), matrixMult(z1, z2))
matrixMult#1(nil, z0) → nil

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

#natmult(#0, z0) → #0
#natmult(#s(z0), z1) → #add(#pos(z1), #natmult(z0, z1))
#add(#pos(#s(#0)), z0) → #succ(z0)
#add(#pos(#s(#s(z0))), z1) → #succ(#add(#pos(#s(z0)), z1))
#add(#0, z0) → z0
#add(#neg(#s(#0)), z0) → #pred(z0)
#add(#neg(#s(#s(z0))), z1) → #pred(#add(#pos(#s(z0)), z1))
#succ(#0) → #pos(#s(#0))
#succ(#neg(#s(#0))) → #0
#succ(#neg(#s(#s(z0)))) → #neg(#s(z0))
#succ(#pos(#s(z0))) → #pos(#s(#s(z0)))
lineMult(z0, z1, z2) → lineMult#1(z1, z2, z0)
lineMult#1(::(z0, z1), z2, z3) → lineMult#2(z2, z3, z0, z1)
lineMult#1(nil, z0, z1) → nil
lineMult#2(::(z0, z1), z2, z3, z4) → ::(+(*(z3, z2), z0), lineMult(z2, z4, z1))
lineMult#2(nil, z0, z1, z2) → ::(*(z1, z0), lineMult(z0, z2, nil))
+(z0, z1) → #add(z0, z1)
*(z0, z1) → #mult(z0, z1)
#mult(#0, #0) → #0
#mult(#0, #neg(z0)) → #0
#mult(#0, #pos(z0)) → #0
#mult(#neg(z0), #0) → #0
#mult(#neg(z0), #neg(z1)) → #pos(#natmult(z0, z1))
#mult(#neg(z0), #pos(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #0) → #0
#mult(#pos(z0), #neg(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #pos(z1)) → #pos(#natmult(z0, z1))
#pred(#0) → #neg(#s(#0))
#pred(#neg(#s(z0))) → #neg(#s(#s(z0)))
#pred(#pos(#s(#0))) → #0
#pred(#pos(#s(#s(z0)))) → #pos(#s(z0))

Tuples:

#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#NATMULT(#s(z0), z1) → c15(#ADD(#pos(z1), #natmult(z0, z1)), #NATMULT(z0, z1))
*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
#ADD(#neg(#s(#s(z0))), z1) → c2(#ADD(#pos(#s(z0)), z1))
#ADD(#pos(#s(#s(z0))), z1) → c4(#ADD(#pos(#s(z0)), z1))

S tuples:

*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))

K tuples:none
Defined Rule Symbols:

#natmult, #add, #succ, lineMult, lineMult#1, lineMult#2, +, *, #mult, #pred

Defined Pair Symbols:

#MULT, #NATMULT, *', +', COMPUTELINE, COMPUTELINE#1, COMPUTELINE#2, LINEMULT, LINEMULT#1, LINEMULT#2, MATRIXMULT, MATRIXMULT#1, #ADD

Compound Symbols:

c9, c10, c12, c13, c15, c24, c25, c26, c27, c29, c31, c32, c34, c35, c36, c37, c2, 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.

MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))

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

#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#NATMULT(#s(z0), z1) → c15(#ADD(#pos(z1), #natmult(z0, z1)), #NATMULT(z0, z1))
*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
#ADD(#neg(#s(#s(z0))), z1) → c2(#ADD(#pos(#s(z0)), z1))
#ADD(#pos(#s(#s(z0))), z1) → c4(#ADD(#pos(#s(z0)), z1))

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

POL(#0) = [2]
POL(#ADD(x₁, x₂)) = 0
POL(#MULT(x₁, x₂)) = 0
POL(#NATMULT(x₁, x₂)) = 0
POL(#add(x₁, x₂)) = [2]x₁
POL(#mult(x₁, x₂)) = [4] + [5]x₁ + [2]x₂
POL(#natmult(x₁, x₂)) = [2]x₁ + [5]x₂
POL(#neg(x₁)) = [3]
POL(#pos(x₁)) = 0
POL(#pred(x₁)) = [3] + [3]x₁
POL(#s(x₁)) = 0
POL(#succ(x₁)) = [3] + [2]x₁
POL(*(x₁, x₂)) = [2] + [2]x₁ + x₂
POL(*'(x₁, x₂)) = 0
POL(+(x₁, x₂)) = [3] + [2]x₁ + [3]x₂
POL(+'(x₁, x₂)) = 0
POL(::(x₁, x₂)) = [4] + x₁ + x₂
POL(COMPUTELINE(x₁, x₂, x₃)) = 0
POL(COMPUTELINE#1(x₁, x₂, x₃)) = 0
POL(COMPUTELINE#2(x₁, x₂, x₃, x₄)) = 0
POL(LINEMULT(x₁, x₂, x₃)) = 0
POL(LINEMULT#1(x₁, x₂, x₃)) = 0
POL(LINEMULT#2(x₁, x₂, x₃, x₄)) = 0
POL(MATRIXMULT(x₁, x₂)) = [4] + [2]x₁
POL(MATRIXMULT#1(x₁, x₂)) = [2]x₁
POL(c10(x₁)) = x₁
POL(c12(x₁)) = x₁
POL(c13(x₁)) = x₁
POL(c15(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c24(x₁)) = x₁
POL(c25(x₁)) = x₁
POL(c26(x₁)) = x₁
POL(c27(x₁)) = x₁
POL(c29(x₁, x₂)) = x₁ + x₂
POL(c31(x₁)) = x₁
POL(c32(x₁)) = x₁
POL(c34(x₁, x₂, x₃)) = x₁ + x₂ + x₃
POL(c35(x₁, x₂)) = x₁ + x₂
POL(c36(x₁)) = x₁
POL(c37(x₁, x₂)) = x₁ + x₂
POL(c4(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(lineMult(x₁, x₂, x₃)) = 0
POL(lineMult#1(x₁, x₂, x₃)) = [2] + [2]x₁ + [3]x₂ + [3]x₃
POL(lineMult#2(x₁, x₂, x₃, x₄)) = [2] + [2]x₁ + [3]x₂ + [5]x₃ + [3]x₄
POL(nil) = 0

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

#natmult(#0, z0) → #0
#natmult(#s(z0), z1) → #add(#pos(z1), #natmult(z0, z1))
#add(#pos(#s(#0)), z0) → #succ(z0)
#add(#pos(#s(#s(z0))), z1) → #succ(#add(#pos(#s(z0)), z1))
#add(#0, z0) → z0
#add(#neg(#s(#0)), z0) → #pred(z0)
#add(#neg(#s(#s(z0))), z1) → #pred(#add(#pos(#s(z0)), z1))
#succ(#0) → #pos(#s(#0))
#succ(#neg(#s(#0))) → #0
#succ(#neg(#s(#s(z0)))) → #neg(#s(z0))
#succ(#pos(#s(z0))) → #pos(#s(#s(z0)))
lineMult(z0, z1, z2) → lineMult#1(z1, z2, z0)
lineMult#1(::(z0, z1), z2, z3) → lineMult#2(z2, z3, z0, z1)
lineMult#1(nil, z0, z1) → nil
lineMult#2(::(z0, z1), z2, z3, z4) → ::(+(*(z3, z2), z0), lineMult(z2, z4, z1))
lineMult#2(nil, z0, z1, z2) → ::(*(z1, z0), lineMult(z0, z2, nil))
+(z0, z1) → #add(z0, z1)
*(z0, z1) → #mult(z0, z1)
#mult(#0, #0) → #0
#mult(#0, #neg(z0)) → #0
#mult(#0, #pos(z0)) → #0
#mult(#neg(z0), #0) → #0
#mult(#neg(z0), #neg(z1)) → #pos(#natmult(z0, z1))
#mult(#neg(z0), #pos(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #0) → #0
#mult(#pos(z0), #neg(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #pos(z1)) → #pos(#natmult(z0, z1))
#pred(#0) → #neg(#s(#0))
#pred(#neg(#s(z0))) → #neg(#s(#s(z0)))
#pred(#pos(#s(#0))) → #0
#pred(#pos(#s(#s(z0)))) → #pos(#s(z0))

Tuples:

#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#NATMULT(#s(z0), z1) → c15(#ADD(#pos(z1), #natmult(z0, z1)), #NATMULT(z0, z1))
*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
#ADD(#neg(#s(#s(z0))), z1) → c2(#ADD(#pos(#s(z0)), z1))
#ADD(#pos(#s(#s(z0))), z1) → c4(#ADD(#pos(#s(z0)), z1))

S tuples:

*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))

K tuples:

MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))

Defined Rule Symbols:

#natmult, #add, #succ, lineMult, lineMult#1, lineMult#2, +, *, #mult, #pred

Defined Pair Symbols:

#MULT, #NATMULT, *', +', COMPUTELINE, COMPUTELINE#1, COMPUTELINE#2, LINEMULT, LINEMULT#1, LINEMULT#2, MATRIXMULT, MATRIXMULT#1, #ADD

Compound Symbols:

c9, c10, c12, c13, c15, c24, c25, c26, c27, c29, c31, c32, c34, c35, c36, c37, c2, c4

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

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

COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))

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

#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#NATMULT(#s(z0), z1) → c15(#ADD(#pos(z1), #natmult(z0, z1)), #NATMULT(z0, z1))
*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
#ADD(#neg(#s(#s(z0))), z1) → c2(#ADD(#pos(#s(z0)), z1))
#ADD(#pos(#s(#s(z0))), z1) → c4(#ADD(#pos(#s(z0)), z1))

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

POL(#0) = [2]
POL(#ADD(x₁, x₂)) = 0
POL(#MULT(x₁, x₂)) = 0
POL(#NATMULT(x₁, x₂)) = 0
POL(#add(x₁, x₂)) = [5] + [5]x₂
POL(#mult(x₁, x₂)) = [5] + [5]x₁ + [2]x₂
POL(#natmult(x₁, x₂)) = [3] + [5]x₁ + [2]x₂
POL(#neg(x₁)) = 0
POL(#pos(x₁)) = 0
POL(#pred(x₁)) = [3] + [3]x₁
POL(#s(x₁)) = [2]
POL(#succ(x₁)) = [4]
POL(*(x₁, x₂)) = [2] + [3]x₁ + [3]x₂
POL(*'(x₁, x₂)) = 0
POL(+(x₁, x₂)) = [5] + [5]x₁ + [2]x₂
POL(+'(x₁, x₂)) = 0
POL(::(x₁, x₂)) = [1] + x₁ + x₂
POL(COMPUTELINE(x₁, x₂, x₃)) = x₁
POL(COMPUTELINE#1(x₁, x₂, x₃)) = x₁
POL(COMPUTELINE#2(x₁, x₂, x₃, x₄)) = x₃ + x₄
POL(LINEMULT(x₁, x₂, x₃)) = 0
POL(LINEMULT#1(x₁, x₂, x₃)) = 0
POL(LINEMULT#2(x₁, x₂, x₃, x₄)) = 0
POL(MATRIXMULT(x₁, x₂)) = x₁
POL(MATRIXMULT#1(x₁, x₂)) = x₁
POL(c10(x₁)) = x₁
POL(c12(x₁)) = x₁
POL(c13(x₁)) = x₁
POL(c15(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c24(x₁)) = x₁
POL(c25(x₁)) = x₁
POL(c26(x₁)) = x₁
POL(c27(x₁)) = x₁
POL(c29(x₁, x₂)) = x₁ + x₂
POL(c31(x₁)) = x₁
POL(c32(x₁)) = x₁
POL(c34(x₁, x₂, x₃)) = x₁ + x₂ + x₃
POL(c35(x₁, x₂)) = x₁ + x₂
POL(c36(x₁)) = x₁
POL(c37(x₁, x₂)) = x₁ + x₂
POL(c4(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(lineMult(x₁, x₂, x₃)) = [3] + [5]x₁ + [4]x₂ + [4]x₃
POL(lineMult#1(x₁, x₂, x₃)) = [5] + [2]x₁ + [3]x₂ + [3]x₃
POL(lineMult#2(x₁, x₂, x₃, x₄)) = [3] + [2]x₁ + [5]x₂ + [5]x₃ + [3]x₄
POL(nil) = 0

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:

#natmult(#0, z0) → #0
#natmult(#s(z0), z1) → #add(#pos(z1), #natmult(z0, z1))
#add(#pos(#s(#0)), z0) → #succ(z0)
#add(#pos(#s(#s(z0))), z1) → #succ(#add(#pos(#s(z0)), z1))
#add(#0, z0) → z0
#add(#neg(#s(#0)), z0) → #pred(z0)
#add(#neg(#s(#s(z0))), z1) → #pred(#add(#pos(#s(z0)), z1))
#succ(#0) → #pos(#s(#0))
#succ(#neg(#s(#0))) → #0
#succ(#neg(#s(#s(z0)))) → #neg(#s(z0))
#succ(#pos(#s(z0))) → #pos(#s(#s(z0)))
lineMult(z0, z1, z2) → lineMult#1(z1, z2, z0)
lineMult#1(::(z0, z1), z2, z3) → lineMult#2(z2, z3, z0, z1)
lineMult#1(nil, z0, z1) → nil
lineMult#2(::(z0, z1), z2, z3, z4) → ::(+(*(z3, z2), z0), lineMult(z2, z4, z1))
lineMult#2(nil, z0, z1, z2) → ::(*(z1, z0), lineMult(z0, z2, nil))
+(z0, z1) → #add(z0, z1)
*(z0, z1) → #mult(z0, z1)
#mult(#0, #0) → #0
#mult(#0, #neg(z0)) → #0
#mult(#0, #pos(z0)) → #0
#mult(#neg(z0), #0) → #0
#mult(#neg(z0), #neg(z1)) → #pos(#natmult(z0, z1))
#mult(#neg(z0), #pos(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #0) → #0
#mult(#pos(z0), #neg(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #pos(z1)) → #pos(#natmult(z0, z1))
#pred(#0) → #neg(#s(#0))
#pred(#neg(#s(z0))) → #neg(#s(#s(z0)))
#pred(#pos(#s(#0))) → #0
#pred(#pos(#s(#s(z0)))) → #pos(#s(z0))

Tuples:

#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#NATMULT(#s(z0), z1) → c15(#ADD(#pos(z1), #natmult(z0, z1)), #NATMULT(z0, z1))
*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
#ADD(#neg(#s(#s(z0))), z1) → c2(#ADD(#pos(#s(z0)), z1))
#ADD(#pos(#s(#s(z0))), z1) → c4(#ADD(#pos(#s(z0)), z1))

S tuples:

*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))

K tuples:

MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))

Defined Rule Symbols:

#natmult, #add, #succ, lineMult, lineMult#1, lineMult#2, +, *, #mult, #pred

Defined Pair Symbols:

#MULT, #NATMULT, *', +', COMPUTELINE, COMPUTELINE#1, COMPUTELINE#2, LINEMULT, LINEMULT#1, LINEMULT#2, MATRIXMULT, MATRIXMULT#1, #ADD

Compound Symbols:

c9, c10, c12, c13, c15, c24, c25, c26, c27, c29, c31, c32, c34, c35, c36, c37, c2, c4

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

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

COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:

#natmult(#0, z0) → #0
#natmult(#s(z0), z1) → #add(#pos(z1), #natmult(z0, z1))
#add(#pos(#s(#0)), z0) → #succ(z0)
#add(#pos(#s(#s(z0))), z1) → #succ(#add(#pos(#s(z0)), z1))
#add(#0, z0) → z0
#add(#neg(#s(#0)), z0) → #pred(z0)
#add(#neg(#s(#s(z0))), z1) → #pred(#add(#pos(#s(z0)), z1))
#succ(#0) → #pos(#s(#0))
#succ(#neg(#s(#0))) → #0
#succ(#neg(#s(#s(z0)))) → #neg(#s(z0))
#succ(#pos(#s(z0))) → #pos(#s(#s(z0)))
lineMult(z0, z1, z2) → lineMult#1(z1, z2, z0)
lineMult#1(::(z0, z1), z2, z3) → lineMult#2(z2, z3, z0, z1)
lineMult#1(nil, z0, z1) → nil
lineMult#2(::(z0, z1), z2, z3, z4) → ::(+(*(z3, z2), z0), lineMult(z2, z4, z1))
lineMult#2(nil, z0, z1, z2) → ::(*(z1, z0), lineMult(z0, z2, nil))
+(z0, z1) → #add(z0, z1)
*(z0, z1) → #mult(z0, z1)
#mult(#0, #0) → #0
#mult(#0, #neg(z0)) → #0
#mult(#0, #pos(z0)) → #0
#mult(#neg(z0), #0) → #0
#mult(#neg(z0), #neg(z1)) → #pos(#natmult(z0, z1))
#mult(#neg(z0), #pos(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #0) → #0
#mult(#pos(z0), #neg(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #pos(z1)) → #pos(#natmult(z0, z1))
#pred(#0) → #neg(#s(#0))
#pred(#neg(#s(z0))) → #neg(#s(#s(z0)))
#pred(#pos(#s(#0))) → #0
#pred(#pos(#s(#s(z0)))) → #pos(#s(z0))

Tuples:

#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#NATMULT(#s(z0), z1) → c15(#ADD(#pos(z1), #natmult(z0, z1)), #NATMULT(z0, z1))
*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
#ADD(#neg(#s(#s(z0))), z1) → c2(#ADD(#pos(#s(z0)), z1))
#ADD(#pos(#s(#s(z0))), z1) → c4(#ADD(#pos(#s(z0)), z1))

S tuples:

*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))

K tuples:

MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))

Defined Rule Symbols:

#natmult, #add, #succ, lineMult, lineMult#1, lineMult#2, +, *, #mult, #pred

Defined Pair Symbols:

#MULT, #NATMULT, *', +', COMPUTELINE, COMPUTELINE#1, COMPUTELINE#2, LINEMULT, LINEMULT#1, LINEMULT#2, MATRIXMULT, MATRIXMULT#1, #ADD

Compound Symbols:

c9, c10, c12, c13, c15, c24, c25, c26, c27, c29, c31, c32, c34, c35, c36, c37, c2, c4

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

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

LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))

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

#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#NATMULT(#s(z0), z1) → c15(#ADD(#pos(z1), #natmult(z0, z1)), #NATMULT(z0, z1))
*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
#ADD(#neg(#s(#s(z0))), z1) → c2(#ADD(#pos(#s(z0)), z1))
#ADD(#pos(#s(#s(z0))), z1) → c4(#ADD(#pos(#s(z0)), z1))

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

POL(#0) = 0
POL(#ADD(x₁, x₂)) = 0
POL(#MULT(x₁, x₂)) = x₁
POL(#NATMULT(x₁, x₂)) = 0
POL(#add(x₁, x₂)) = 0
POL(#mult(x₁, x₂)) = 0
POL(#natmult(x₁, x₂)) = 0
POL(#neg(x₁)) = 0
POL(#pos(x₁)) = 0
POL(#pred(x₁)) = 0
POL(#s(x₁)) = 0
POL(#succ(x₁)) = 0
POL(*(x₁, x₂)) = 0
POL(*'(x₁, x₂)) = x₁
POL(+(x₁, x₂)) = 0
POL(+'(x₁, x₂)) = 0
POL(::(x₁, x₂)) = [2] + x₁ + x₂
POL(COMPUTELINE(x₁, x₂, x₃)) = [3]x₁·x₂
POL(COMPUTELINE#1(x₁, x₂, x₃)) = [3]x₁·x₃
POL(COMPUTELINE#2(x₁, x₂, x₃, x₄)) = [2]x₁ + [3]x₁·x₄ + [3]x₁·x₃
POL(LINEMULT(x₁, x₂, x₃)) = [2]x₂
POL(LINEMULT#1(x₁, x₂, x₃)) = [2]x₁
POL(LINEMULT#2(x₁, x₂, x₃, x₄)) = [3] + x₃ + [2]x₄
POL(MATRIXMULT(x₁, x₂)) = [3]x₂ + [3]x₁·x₂
POL(MATRIXMULT#1(x₁, x₂)) = [3]x₁·x₂
POL(c10(x₁)) = x₁
POL(c12(x₁)) = x₁
POL(c13(x₁)) = x₁
POL(c15(x₁, x₂)) = x₁ + x₂
POL(c2(x₁)) = x₁
POL(c24(x₁)) = x₁
POL(c25(x₁)) = x₁
POL(c26(x₁)) = x₁
POL(c27(x₁)) = x₁
POL(c29(x₁, x₂)) = x₁ + x₂
POL(c31(x₁)) = x₁
POL(c32(x₁)) = x₁
POL(c34(x₁, x₂, x₃)) = x₁ + x₂ + x₃
POL(c35(x₁, x₂)) = x₁ + x₂
POL(c36(x₁)) = x₁
POL(c37(x₁, x₂)) = x₁ + x₂
POL(c4(x₁)) = x₁
POL(c9(x₁)) = x₁
POL(lineMult(x₁, x₂, x₃)) = 0
POL(lineMult#1(x₁, x₂, x₃)) = 0
POL(lineMult#2(x₁, x₂, x₃, x₄)) = 0
POL(nil) = 0

(16) Obligation:

Complexity Dependency Tuples Problem
Rules:

#natmult(#0, z0) → #0
#natmult(#s(z0), z1) → #add(#pos(z1), #natmult(z0, z1))
#add(#pos(#s(#0)), z0) → #succ(z0)
#add(#pos(#s(#s(z0))), z1) → #succ(#add(#pos(#s(z0)), z1))
#add(#0, z0) → z0
#add(#neg(#s(#0)), z0) → #pred(z0)
#add(#neg(#s(#s(z0))), z1) → #pred(#add(#pos(#s(z0)), z1))
#succ(#0) → #pos(#s(#0))
#succ(#neg(#s(#0))) → #0
#succ(#neg(#s(#s(z0)))) → #neg(#s(z0))
#succ(#pos(#s(z0))) → #pos(#s(#s(z0)))
lineMult(z0, z1, z2) → lineMult#1(z1, z2, z0)
lineMult#1(::(z0, z1), z2, z3) → lineMult#2(z2, z3, z0, z1)
lineMult#1(nil, z0, z1) → nil
lineMult#2(::(z0, z1), z2, z3, z4) → ::(+(*(z3, z2), z0), lineMult(z2, z4, z1))
lineMult#2(nil, z0, z1, z2) → ::(*(z1, z0), lineMult(z0, z2, nil))
+(z0, z1) → #add(z0, z1)
*(z0, z1) → #mult(z0, z1)
#mult(#0, #0) → #0
#mult(#0, #neg(z0)) → #0
#mult(#0, #pos(z0)) → #0
#mult(#neg(z0), #0) → #0
#mult(#neg(z0), #neg(z1)) → #pos(#natmult(z0, z1))
#mult(#neg(z0), #pos(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #0) → #0
#mult(#pos(z0), #neg(z1)) → #neg(#natmult(z0, z1))
#mult(#pos(z0), #pos(z1)) → #pos(#natmult(z0, z1))
#pred(#0) → #neg(#s(#0))
#pred(#neg(#s(z0))) → #neg(#s(#s(z0)))
#pred(#pos(#s(#0))) → #0
#pred(#pos(#s(#s(z0)))) → #pos(#s(z0))

Tuples:

#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#NATMULT(#s(z0), z1) → c15(#ADD(#pos(z1), #natmult(z0, z1)), #NATMULT(z0, z1))
*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))
MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
#ADD(#neg(#s(#s(z0))), z1) → c2(#ADD(#pos(#s(z0)), z1))
#ADD(#pos(#s(#s(z0))), z1) → c4(#ADD(#pos(#s(z0)), z1))

S tuples:

*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))

K tuples:

MATRIXMULT(z0, z1) → c36(MATRIXMULT#1(z0, z1))
MATRIXMULT#1(::(z0, z1), z2) → c37(COMPUTELINE(z0, z2, nil), MATRIXMULT(z1, z2))
COMPUTELINE#1(::(z0, z1), z2, z3) → c27(COMPUTELINE#2(z3, z2, z0, z1))
COMPUTELINE#2(::(z0, z1), z2, z3, z4) → c29(COMPUTELINE(z4, z1, lineMult(z3, z0, z2)), LINEMULT(z3, z0, z2))
COMPUTELINE(z0, z1, z2) → c26(COMPUTELINE#1(z0, z2, z1))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))
LINEMULT#2(::(z0, z1), z2, z3, z4) → c34(+'(*(z3, z2), z0), *'(z3, z2), LINEMULT(z2, z4, z1))
LINEMULT#2(nil, z0, z1, z2) → c35(*'(z1, z0), LINEMULT(z0, z2, nil))

Defined Rule Symbols:

#natmult, #add, #succ, lineMult, lineMult#1, lineMult#2, +, *, #mult, #pred

Defined Pair Symbols:

#MULT, #NATMULT, *', +', COMPUTELINE, COMPUTELINE#1, COMPUTELINE#2, LINEMULT, LINEMULT#1, LINEMULT#2, MATRIXMULT, MATRIXMULT#1, #ADD

Compound Symbols:

c9, c10, c12, c13, c15, c24, c25, c26, c27, c29, c31, c32, c34, c35, c36, c37, c2, c4

(17) CdtKnowledgeProof (EQUIVALENT transformation)

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

*'(z0, z1) → c24(#MULT(z0, z1))
+'(z0, z1) → c25(#ADD(z0, z1))
LINEMULT(z0, z1, z2) → c31(LINEMULT#1(z1, z2, z0))
#MULT(#neg(z0), #neg(z1)) → c9(#NATMULT(z0, z1))
#MULT(#neg(z0), #pos(z1)) → c10(#NATMULT(z0, z1))
#MULT(#pos(z0), #neg(z1)) → c12(#NATMULT(z0, z1))
#MULT(#pos(z0), #pos(z1)) → c13(#NATMULT(z0, z1))
#ADD(#neg(#s(#s(z0))), z1) → c2(#ADD(#pos(#s(z0)), z1))
LINEMULT#1(::(z0, z1), z2, z3) → c32(LINEMULT#2(z2, z3, z0, z1))

Now S is empty

(0) Obligation:

(1) CpxTrsToCdtProof (UPPER BOUND(ID) transformation)

(2) Obligation:

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

(4) Obligation:

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

(6) Obligation:

(7) CdtUsableRulesProof (EQUIVALENT transformation)

(8) Obligation:

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

(10) Obligation:

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

(12) Obligation:

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

(14) Obligation:

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

(16) Obligation:

(17) CdtKnowledgeProof (EQUIVALENT transformation)

(18) BOUNDS(1, 1)