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

0 CpxTRS
↳1 NestedDefinedSymbolProof (BOTH BOUNDS(ID, ID), 0 ms)
↳2 CpxTRS
    ↳3 CpxTrsMatchBoundsTAProof (⇔, 54 ms)
    ↳4 BOUNDS(1, n^1)
    ↳5 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID), 0 ms)
    ↳6 CdtProblem
        ↳7 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID), 0 ms)
        ↳8 CdtProblem
        ↳9 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID), 0 ms)
        ↳10 CdtProblem
        ↳11 CdtUsableRulesProof (⇔, 2 ms)
        ↳12 CdtProblem
        ↳13 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 115 ms)
        ↳14 CdtProblem
        ↳15 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 20 ms)
        ↳16 CdtProblem
        ↳17 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 19 ms)
        ↳18 CdtProblem
        ↳19 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 0 ms)
        ↳20 CdtProblem
        ↳21 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 16 ms)
        ↳22 CdtProblem
        ↳23 CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)), 51 ms)
        ↳24 CdtProblem
        ↳25 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 0 ms)
        ↳26 CdtProblem
        ↳27 SIsEmptyProof (BOTH BOUNDS(ID, ID), 0 ms)
        ↳28 BOUNDS(1, 1)

(0) Obligation:

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


The TRS R consists of the following rules:

active(f(X)) → mark(cons(X, f(g(X))))
active(g(0)) → mark(s(0))
active(g(s(X))) → mark(s(s(g(X))))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(f(X)) → f(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(g(X)) → g(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
f(mark(X)) → mark(f(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
g(mark(X)) → mark(g(X))
s(mark(X)) → mark(s(X))
sel(mark(X1), X2) → mark(sel(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
proper(f(X)) → f(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(g(X)) → g(proper(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))
f(ok(X)) → ok(f(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
g(ok(X)) → ok(g(X))
s(ok(X)) → ok(s(X))
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Rewrite Strategy: INNERMOST

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

The following defined symbols can occur below the 0th argument of top: proper, active
The following defined symbols can occur below the 0th argument of proper: proper, active
The following defined symbols can occur below the 0th argument of active: proper, active

Hence, the left-hand sides of the following rules are not basic-reachable and can be removed:
active(f(X)) → mark(cons(X, f(g(X))))
active(g(0)) → mark(s(0))
active(g(s(X))) → mark(s(s(g(X))))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(f(X)) → f(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(g(X)) → g(active(X))
active(s(X)) → s(active(X))
active(sel(X1, X2)) → sel(active(X1), X2)
active(sel(X1, X2)) → sel(X1, active(X2))
proper(f(X)) → f(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(g(X)) → g(proper(X))
proper(s(X)) → s(proper(X))
proper(sel(X1, X2)) → sel(proper(X1), proper(X2))

(2) Obligation:

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


The TRS R consists of the following rules:

g(ok(X)) → ok(g(X))
top(ok(X)) → top(active(X))
f(mark(X)) → mark(f(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
sel(mark(X1), X2) → mark(sel(X1, X2))
f(ok(X)) → ok(f(X))
g(mark(X)) → mark(g(X))
s(ok(X)) → ok(s(X))
s(mark(X)) → mark(s(X))
proper(0) → ok(0)
sel(ok(X1), ok(X2)) → ok(sel(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
sel(X1, mark(X2)) → mark(sel(X1, X2))
top(mark(X)) → top(proper(X))

Rewrite Strategy: INNERMOST

(3) CpxTrsMatchBoundsTAProof (EQUIVALENT transformation)

A linear upper bound on the runtime complexity of the TRS R could be shown with a Match-Bound[TAB_LEFTLINEAR,TAB_NONLEFTLINEAR] (for contructor-based start-terms) of 2.

The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by:
final states : [1, 2, 3, 4, 5, 6, 7]
transitions:
ok0(0) → 0
active0(0) → 0
mark0(0) → 0
00() → 0
g0(0) → 1
top0(0) → 2
f0(0) → 3
cons0(0, 0) → 4
sel0(0, 0) → 5
s0(0) → 6
proper0(0) → 7
g1(0) → 8
ok1(8) → 1
active1(0) → 9
top1(9) → 2
f1(0) → 10
mark1(10) → 3
cons1(0, 0) → 11
ok1(11) → 4
sel1(0, 0) → 12
mark1(12) → 5
f1(0) → 13
ok1(13) → 3
g1(0) → 14
mark1(14) → 1
s1(0) → 15
ok1(15) → 6
s1(0) → 16
mark1(16) → 6
01() → 17
ok1(17) → 7
sel1(0, 0) → 18
ok1(18) → 5
cons1(0, 0) → 19
mark1(19) → 4
proper1(0) → 20
top1(20) → 2
ok1(8) → 8
ok1(8) → 14
mark1(10) → 10
mark1(10) → 13
ok1(11) → 11
ok1(11) → 19
mark1(12) → 12
mark1(12) → 18
ok1(13) → 10
ok1(13) → 13
mark1(14) → 8
mark1(14) → 14
ok1(15) → 15
ok1(15) → 16
mark1(16) → 15
mark1(16) → 16
ok1(17) → 20
ok1(18) → 12
ok1(18) → 18
mark1(19) → 11
mark1(19) → 19
active2(17) → 21
top2(21) → 2

(4) BOUNDS(1, n^1)

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

Converted Cpx (relative) TRS to CDT

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

g(ok(z0)) → ok(g(z0))
g(mark(z0)) → mark(g(z0))
top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
f(mark(z0)) → mark(f(z0))
f(ok(z0)) → ok(f(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))
proper(0) → ok(0)
Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
TOP(ok(z0)) → c2(TOP(active(z0)))
TOP(mark(z0)) → c3(TOP(proper(z0)), PROPER(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
PROPER(0) → c13
S tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
TOP(ok(z0)) → c2(TOP(active(z0)))
TOP(mark(z0)) → c3(TOP(proper(z0)), PROPER(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
PROPER(0) → c13
K tuples:none
Defined Rule Symbols:

g, top, f, cons, sel, s, proper

Defined Pair Symbols:

G, TOP, F, CONS, SEL, S, PROPER

Compound Symbols:

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

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

Removed 2 trailing nodes:

TOP(ok(z0)) → c2(TOP(active(z0)))
PROPER(0) → c13

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

g(ok(z0)) → ok(g(z0))
g(mark(z0)) → mark(g(z0))
top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
f(mark(z0)) → mark(f(z0))
f(ok(z0)) → ok(f(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))
proper(0) → ok(0)
Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)), PROPER(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
S tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)), PROPER(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
K tuples:none
Defined Rule Symbols:

g, top, f, cons, sel, s, proper

Defined Pair Symbols:

G, TOP, F, CONS, SEL, S

Compound Symbols:

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

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

Removed 1 trailing tuple parts

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

g(ok(z0)) → ok(g(z0))
g(mark(z0)) → mark(g(z0))
top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
f(mark(z0)) → mark(f(z0))
f(ok(z0)) → ok(f(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))
proper(0) → ok(0)
Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
S tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
K tuples:none
Defined Rule Symbols:

g, top, f, cons, sel, s, proper

Defined Pair Symbols:

G, F, CONS, SEL, S, TOP

Compound Symbols:

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

(11) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

g(ok(z0)) → ok(g(z0))
g(mark(z0)) → mark(g(z0))
top(ok(z0)) → top(active(z0))
top(mark(z0)) → top(proper(z0))
f(mark(z0)) → mark(f(z0))
f(ok(z0)) → ok(f(z0))
cons(ok(z0), ok(z1)) → ok(cons(z0, z1))
cons(mark(z0), z1) → mark(cons(z0, z1))
sel(mark(z0), z1) → mark(sel(z0, z1))
sel(ok(z0), ok(z1)) → ok(sel(z0, z1))
sel(z0, mark(z1)) → mark(sel(z0, z1))
s(ok(z0)) → ok(s(z0))
s(mark(z0)) → mark(s(z0))

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(0) → ok(0)
Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
S tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
K tuples:none
Defined Rule Symbols:

proper

Defined Pair Symbols:

G, F, CONS, SEL, S, TOP

Compound Symbols:

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

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

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

TOP(mark(z0)) → c3(TOP(proper(z0)))
We considered the (Usable) Rules:

proper(0) → ok(0)
And the Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(CONS(x1, x2)) = 0   
POL(F(x1)) = 0   
POL(G(x1)) = 0   
POL(S(x1)) = 0   
POL(SEL(x1, x2)) = 0   
POL(TOP(x1)) = x1   
POL(c(x1)) = x1   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c3(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = [1] + x1   
POL(ok(x1)) = 0   
POL(proper(x1)) = 0   

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(0) → ok(0)
Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
S tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
K tuples:

TOP(mark(z0)) → c3(TOP(proper(z0)))
Defined Rule Symbols:

proper

Defined Pair Symbols:

G, F, CONS, SEL, S, TOP

Compound Symbols:

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

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

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

G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
S(mark(z0)) → c12(S(z0))
We considered the (Usable) Rules:none
And the Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = [1]   
POL(CONS(x1, x2)) = 0   
POL(F(x1)) = x1   
POL(G(x1)) = x1   
POL(S(x1)) = x1   
POL(SEL(x1, x2)) = 0   
POL(TOP(x1)) = 0   
POL(c(x1)) = x1   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c3(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = [1] + x1   
POL(ok(x1)) = x1   
POL(proper(x1)) = x1   

(16) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(0) → ok(0)
Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
S tuples:

G(ok(z0)) → c(G(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
K tuples:

TOP(mark(z0)) → c3(TOP(proper(z0)))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
S(mark(z0)) → c12(S(z0))
Defined Rule Symbols:

proper

Defined Pair Symbols:

G, F, CONS, SEL, S, TOP

Compound Symbols:

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

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

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

S(ok(z0)) → c11(S(z0))
We considered the (Usable) Rules:none
And the Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(CONS(x1, x2)) = 0   
POL(F(x1)) = 0   
POL(G(x1)) = 0   
POL(S(x1)) = x1   
POL(SEL(x1, x2)) = 0   
POL(TOP(x1)) = 0   
POL(c(x1)) = x1   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c3(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = x1   
POL(ok(x1)) = [1] + x1   
POL(proper(x1)) = 0   

(18) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(0) → ok(0)
Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
S tuples:

G(ok(z0)) → c(G(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
K tuples:

TOP(mark(z0)) → c3(TOP(proper(z0)))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
S(mark(z0)) → c12(S(z0))
S(ok(z0)) → c11(S(z0))
Defined Rule Symbols:

proper

Defined Pair Symbols:

G, F, CONS, SEL, S, TOP

Compound Symbols:

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

(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.

CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
We considered the (Usable) Rules:none
And the Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(CONS(x1, x2)) = x1   
POL(F(x1)) = 0   
POL(G(x1)) = 0   
POL(S(x1)) = 0   
POL(SEL(x1, x2)) = x1   
POL(TOP(x1)) = 0   
POL(c(x1)) = x1   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c3(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = [1] + x1   
POL(ok(x1)) = [1] + x1   
POL(proper(x1)) = [1]   

(20) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(0) → ok(0)
Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
S tuples:

G(ok(z0)) → c(G(z0))
F(ok(z0)) → c5(F(z0))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
K tuples:

TOP(mark(z0)) → c3(TOP(proper(z0)))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
S(mark(z0)) → c12(S(z0))
S(ok(z0)) → c11(S(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
Defined Rule Symbols:

proper

Defined Pair Symbols:

G, F, CONS, SEL, S, TOP

Compound Symbols:

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

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

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

SEL(z0, mark(z1)) → c10(SEL(z0, z1))
We considered the (Usable) Rules:none
And the Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(CONS(x1, x2)) = 0   
POL(F(x1)) = 0   
POL(G(x1)) = 0   
POL(S(x1)) = 0   
POL(SEL(x1, x2)) = x2   
POL(TOP(x1)) = 0   
POL(c(x1)) = x1   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c3(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = [1] + x1   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   

(22) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(0) → ok(0)
Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
S tuples:

G(ok(z0)) → c(G(z0))
F(ok(z0)) → c5(F(z0))
K tuples:

TOP(mark(z0)) → c3(TOP(proper(z0)))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
S(mark(z0)) → c12(S(z0))
S(ok(z0)) → c11(S(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
Defined Rule Symbols:

proper

Defined Pair Symbols:

G, F, CONS, SEL, S, TOP

Compound Symbols:

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

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

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

G(ok(z0)) → c(G(z0))
We considered the (Usable) Rules:none
And the Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = [1]   
POL(CONS(x1, x2)) = x1·x2 + x12   
POL(F(x1)) = 0   
POL(G(x1)) = [2]x1   
POL(S(x1)) = 0   
POL(SEL(x1, x2)) = x1·x2   
POL(TOP(x1)) = 0   
POL(c(x1)) = x1   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c3(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = [1] + x1   
POL(ok(x1)) = [1] + x1   
POL(proper(x1)) = [1] + [2]x12   

(24) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(0) → ok(0)
Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
S tuples:

F(ok(z0)) → c5(F(z0))
K tuples:

TOP(mark(z0)) → c3(TOP(proper(z0)))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
S(mark(z0)) → c12(S(z0))
S(ok(z0)) → c11(S(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
G(ok(z0)) → c(G(z0))
Defined Rule Symbols:

proper

Defined Pair Symbols:

G, F, CONS, SEL, S, TOP

Compound Symbols:

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

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

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

F(ok(z0)) → c5(F(z0))
We considered the (Usable) Rules:none
And the Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(0) = 0   
POL(CONS(x1, x2)) = 0   
POL(F(x1)) = x1   
POL(G(x1)) = 0   
POL(S(x1)) = 0   
POL(SEL(x1, x2)) = 0   
POL(TOP(x1)) = 0   
POL(c(x1)) = x1   
POL(c1(x1)) = x1   
POL(c10(x1)) = x1   
POL(c11(x1)) = x1   
POL(c12(x1)) = x1   
POL(c3(x1)) = x1   
POL(c4(x1)) = x1   
POL(c5(x1)) = x1   
POL(c6(x1)) = x1   
POL(c7(x1)) = x1   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(mark(x1)) = x1   
POL(ok(x1)) = [1] + x1   
POL(proper(x1)) = 0   

(26) Obligation:

Complexity Dependency Tuples Problem
Rules:

proper(0) → ok(0)
Tuples:

G(ok(z0)) → c(G(z0))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
F(ok(z0)) → c5(F(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
S(ok(z0)) → c11(S(z0))
S(mark(z0)) → c12(S(z0))
TOP(mark(z0)) → c3(TOP(proper(z0)))
S tuples:none
K tuples:

TOP(mark(z0)) → c3(TOP(proper(z0)))
G(mark(z0)) → c1(G(z0))
F(mark(z0)) → c4(F(z0))
S(mark(z0)) → c12(S(z0))
S(ok(z0)) → c11(S(z0))
CONS(ok(z0), ok(z1)) → c6(CONS(z0, z1))
CONS(mark(z0), z1) → c7(CONS(z0, z1))
SEL(mark(z0), z1) → c8(SEL(z0, z1))
SEL(ok(z0), ok(z1)) → c9(SEL(z0, z1))
SEL(z0, mark(z1)) → c10(SEL(z0, z1))
G(ok(z0)) → c(G(z0))
F(ok(z0)) → c5(F(z0))
Defined Rule Symbols:

proper

Defined Pair Symbols:

G, F, CONS, SEL, S, TOP

Compound Symbols:

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

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

The set S is empty

(28) BOUNDS(1, 1)