The rewrite relation of the following TRS is considered.
active#(nats) |
→ |
mark#(cons(0,incr(nats))) |
(28) |
active#(nats) |
→ |
cons#(0,incr(nats)) |
(29) |
active#(nats) |
→ |
incr#(nats) |
(30) |
active#(pairs) |
→ |
mark#(cons(0,incr(odds))) |
(31) |
active#(pairs) |
→ |
cons#(0,incr(odds)) |
(32) |
active#(pairs) |
→ |
incr#(odds) |
(33) |
active#(odds) |
→ |
mark#(incr(pairs)) |
(34) |
active#(odds) |
→ |
incr#(pairs) |
(35) |
active#(incr(cons(X,XS))) |
→ |
mark#(cons(s(X),incr(XS))) |
(36) |
active#(incr(cons(X,XS))) |
→ |
cons#(s(X),incr(XS)) |
(37) |
active#(incr(cons(X,XS))) |
→ |
s#(X) |
(38) |
active#(incr(cons(X,XS))) |
→ |
incr#(XS) |
(39) |
mark#(nats) |
→ |
active#(nats) |
(40) |
mark#(cons(X1,X2)) |
→ |
active#(cons(mark(X1),X2)) |
(41) |
mark#(cons(X1,X2)) |
→ |
cons#(mark(X1),X2) |
(42) |
mark#(cons(X1,X2)) |
→ |
mark#(X1) |
(43) |
mark#(0) |
→ |
active#(0) |
(44) |
mark#(incr(X)) |
→ |
active#(incr(mark(X))) |
(45) |
mark#(incr(X)) |
→ |
incr#(mark(X)) |
(46) |
mark#(incr(X)) |
→ |
mark#(X) |
(47) |
mark#(pairs) |
→ |
active#(pairs) |
(48) |
mark#(odds) |
→ |
active#(odds) |
(49) |
mark#(s(X)) |
→ |
active#(s(mark(X))) |
(50) |
mark#(s(X)) |
→ |
s#(mark(X)) |
(51) |
mark#(s(X)) |
→ |
mark#(X) |
(52) |
mark#(head(X)) |
→ |
active#(head(mark(X))) |
(53) |
mark#(head(X)) |
→ |
head#(mark(X)) |
(54) |
mark#(head(X)) |
→ |
mark#(X) |
(55) |
mark#(tail(X)) |
→ |
active#(tail(mark(X))) |
(56) |
mark#(tail(X)) |
→ |
tail#(mark(X)) |
(57) |
mark#(tail(X)) |
→ |
mark#(X) |
(58) |
cons#(mark(X1),X2) |
→ |
cons#(X1,X2) |
(59) |
cons#(X1,mark(X2)) |
→ |
cons#(X1,X2) |
(60) |
cons#(active(X1),X2) |
→ |
cons#(X1,X2) |
(61) |
cons#(X1,active(X2)) |
→ |
cons#(X1,X2) |
(62) |
incr#(mark(X)) |
→ |
incr#(X) |
(63) |
incr#(active(X)) |
→ |
incr#(X) |
(64) |
s#(mark(X)) |
→ |
s#(X) |
(65) |
s#(active(X)) |
→ |
s#(X) |
(66) |
head#(mark(X)) |
→ |
head#(X) |
(67) |
head#(active(X)) |
→ |
head#(X) |
(68) |
tail#(mark(X)) |
→ |
tail#(X) |
(69) |
tail#(active(X)) |
→ |
tail#(X) |
(70) |
The dependency pairs are split into 6
components.
-
The
1st
component contains the
pair
mark#(cons(X1,X2)) |
→ |
active#(cons(mark(X1),X2)) |
(41) |
active#(incr(cons(X,XS))) |
→ |
mark#(cons(s(X),incr(XS))) |
(36) |
mark#(cons(X1,X2)) |
→ |
mark#(X1) |
(43) |
mark#(nats) |
→ |
active#(nats) |
(40) |
active#(nats) |
→ |
mark#(cons(0,incr(nats))) |
(28) |
mark#(incr(X)) |
→ |
active#(incr(mark(X))) |
(45) |
mark#(incr(X)) |
→ |
mark#(X) |
(47) |
mark#(pairs) |
→ |
active#(pairs) |
(48) |
active#(pairs) |
→ |
mark#(cons(0,incr(odds))) |
(31) |
mark#(odds) |
→ |
active#(odds) |
(49) |
active#(odds) |
→ |
mark#(incr(pairs)) |
(34) |
mark#(s(X)) |
→ |
active#(s(mark(X))) |
(50) |
mark#(s(X)) |
→ |
mark#(X) |
(52) |
mark#(head(X)) |
→ |
active#(head(mark(X))) |
(53) |
mark#(head(X)) |
→ |
mark#(X) |
(55) |
mark#(tail(X)) |
→ |
active#(tail(mark(X))) |
(56) |
mark#(tail(X)) |
→ |
mark#(X) |
(58) |
1.1.1.1.1 Monotonic Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[nats] |
= |
0 |
[mark(x1)] |
= |
1 · x1
|
[cons(x1, x2)] |
= |
1 · x1 + 1 · x2
|
[0] |
= |
0 |
[incr(x1)] |
= |
2 · x1
|
[pairs] |
= |
0 |
[odds] |
= |
0 |
[s(x1)] |
= |
1 · x1
|
[head(x1)] |
= |
2 + 2 · x1
|
[tail(x1)] |
= |
2 · x1
|
[mark#(x1)] |
= |
1 · x1
|
[active#(x1)] |
= |
1 · x1
|
the
pair
mark#(head(X)) |
→ |
mark#(X) |
(55) |
and
no rules
could be deleted.
1.1.1.1.1.1 Monotonic Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[nats] |
= |
0 |
[mark(x1)] |
= |
1 · x1
|
[cons(x1, x2)] |
= |
2 · x1 + 1 · x2
|
[0] |
= |
0 |
[incr(x1)] |
= |
2 · x1
|
[pairs] |
= |
0 |
[odds] |
= |
0 |
[s(x1)] |
= |
1 · x1
|
[head(x1)] |
= |
1 · x1
|
[tail(x1)] |
= |
2 + 2 · x1
|
[mark#(x1)] |
= |
2 · x1
|
[active#(x1)] |
= |
2 · x1
|
the
pair
mark#(tail(X)) |
→ |
mark#(X) |
(58) |
and
no rules
could be deleted.
1.1.1.1.1.1.1 Reduction Pair Processor
Using the Knuth Bendix order with w0 = 1 and the following precedence and weight functions
prec(nats) |
= |
1 |
|
weight(nats) |
= |
1 |
|
|
|
prec(0) |
= |
0 |
|
weight(0) |
= |
1 |
|
|
|
prec(pairs) |
= |
3 |
|
weight(pairs) |
= |
2 |
|
|
|
prec(odds) |
= |
5 |
|
weight(odds) |
= |
3 |
|
|
|
prec(head) |
= |
4 |
|
weight(head) |
= |
2 |
|
|
|
prec(tail) |
= |
2 |
|
weight(tail) |
= |
2 |
|
|
|
in combination with the following argument filter
π(mark#) |
= |
1 |
π(cons) |
= |
1 |
π(active#) |
= |
1 |
π(mark) |
= |
1 |
π(incr) |
= |
1 |
π(s) |
= |
1 |
π(nats) |
= |
[] |
π(0) |
= |
[] |
π(pairs) |
= |
[] |
π(odds) |
= |
[] |
π(head) |
= |
[] |
π(tail) |
= |
[] |
π(active) |
= |
1 |
the
pairs
active#(nats) |
→ |
mark#(cons(0,incr(nats))) |
(28) |
active#(pairs) |
→ |
mark#(cons(0,incr(odds))) |
(31) |
active#(odds) |
→ |
mark#(incr(pairs)) |
(34) |
could be deleted.
1.1.1.1.1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.
-
The
1st
component contains the
pair
active#(incr(cons(X,XS))) |
→ |
mark#(cons(s(X),incr(XS))) |
(36) |
mark#(cons(X1,X2)) |
→ |
active#(cons(mark(X1),X2)) |
(41) |
mark#(cons(X1,X2)) |
→ |
mark#(X1) |
(43) |
mark#(incr(X)) |
→ |
active#(incr(mark(X))) |
(45) |
mark#(incr(X)) |
→ |
mark#(X) |
(47) |
mark#(s(X)) |
→ |
active#(s(mark(X))) |
(50) |
mark#(s(X)) |
→ |
mark#(X) |
(52) |
mark#(head(X)) |
→ |
active#(head(mark(X))) |
(53) |
mark#(tail(X)) |
→ |
active#(tail(mark(X))) |
(56) |
1.1.1.1.1.1.1.1.1 Reduction Pair Processor
Using the Knuth Bendix order with w0 = 1 and the following precedence and weight functions
prec(cons) |
= |
6 |
|
weight(cons) |
= |
1 |
|
|
|
prec(head) |
= |
4 |
|
weight(head) |
= |
2 |
|
|
|
prec(tail) |
= |
1 |
|
weight(tail) |
= |
1 |
|
|
|
prec(nats) |
= |
0 |
|
weight(nats) |
= |
4 |
|
|
|
prec(0) |
= |
3 |
|
weight(0) |
= |
2 |
|
|
|
prec(pairs) |
= |
2 |
|
weight(pairs) |
= |
4 |
|
|
|
prec(odds) |
= |
5 |
|
weight(odds) |
= |
5 |
|
|
|
in combination with the following argument filter
π(active#) |
= |
1 |
π(incr) |
= |
1 |
π(cons) |
= |
[1] |
π(mark#) |
= |
1 |
π(s) |
= |
1 |
π(mark) |
= |
1 |
π(head) |
= |
[] |
π(tail) |
= |
[] |
π(active) |
= |
1 |
π(nats) |
= |
[] |
π(0) |
= |
[] |
π(pairs) |
= |
[] |
π(odds) |
= |
[] |
the
pair
mark#(cons(X1,X2)) |
→ |
mark#(X1) |
(43) |
could be deleted.
1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active#(x1)] |
= |
x1 |
[mark#(x1)] |
= |
2 |
[cons(x1, x2)] |
= |
-2 |
[s(x1)] |
= |
0 |
[active(x1)] |
= |
2 |
[mark(x1)] |
= |
1 |
[incr(x1)] |
= |
2 |
[head(x1)] |
= |
1 |
[tail(x1)] |
= |
-2 |
[nats] |
= |
0 |
[0] |
= |
0 |
[pairs] |
= |
0 |
[odds] |
= |
0 |
together with the usable
rules
s(active(X)) |
→ |
s(X) |
(23) |
s(mark(X)) |
→ |
s(X) |
(22) |
incr(active(X)) |
→ |
incr(X) |
(21) |
incr(mark(X)) |
→ |
incr(X) |
(20) |
cons(X1,mark(X2)) |
→ |
cons(X1,X2) |
(17) |
cons(mark(X1),X2) |
→ |
cons(X1,X2) |
(16) |
cons(active(X1),X2) |
→ |
cons(X1,X2) |
(18) |
cons(X1,active(X2)) |
→ |
cons(X1,X2) |
(19) |
head(active(X)) |
→ |
head(X) |
(25) |
head(mark(X)) |
→ |
head(X) |
(24) |
tail(active(X)) |
→ |
tail(X) |
(27) |
tail(mark(X)) |
→ |
tail(X) |
(26) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(cons(X1,X2)) |
→ |
active#(cons(mark(X1),X2)) |
(41) |
mark#(s(X)) |
→ |
active#(s(mark(X))) |
(50) |
mark#(head(X)) |
→ |
active#(head(mark(X))) |
(53) |
mark#(tail(X)) |
→ |
active#(tail(mark(X))) |
(56) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the Knuth Bendix order with w0 = 1 and the following precedence and weight functions
prec(active#) |
= |
1 |
|
weight(active#) |
= |
1 |
|
|
|
prec(cons) |
= |
0 |
|
weight(cons) |
= |
1 |
|
|
|
prec(incr) |
= |
2 |
|
weight(incr) |
= |
1 |
|
|
|
in combination with the following argument filter
π(active#) |
= |
[] |
π(mark#) |
= |
1 |
π(cons) |
= |
[] |
π(incr) |
= |
[1] |
π(s) |
= |
1 |
together with the usable
rules
cons(X1,mark(X2)) |
→ |
cons(X1,X2) |
(17) |
cons(mark(X1),X2) |
→ |
cons(X1,X2) |
(16) |
cons(active(X1),X2) |
→ |
cons(X1,X2) |
(18) |
cons(X1,active(X2)) |
→ |
cons(X1,X2) |
(19) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
active#(incr(cons(X,XS))) |
→ |
mark#(cons(s(X),incr(XS))) |
(36) |
mark#(incr(X)) |
→ |
active#(incr(mark(X))) |
(45) |
mark#(incr(X)) |
→ |
mark#(X) |
(47) |
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[s(x1)] |
= |
1 · x1
|
[mark#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.1.1.1.1.1.1.1.1.1.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
mark#(s(X)) |
→ |
mark#(X) |
(52) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
2nd
component contains the
pair
cons#(X1,mark(X2)) |
→ |
cons#(X1,X2) |
(60) |
cons#(mark(X1),X2) |
→ |
cons#(X1,X2) |
(59) |
cons#(active(X1),X2) |
→ |
cons#(X1,X2) |
(61) |
cons#(X1,active(X2)) |
→ |
cons#(X1,X2) |
(62) |
1.1.1.1.2 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[mark(x1)] |
= |
1 · x1
|
[active(x1)] |
= |
1 · x1
|
[cons#(x1, x2)] |
= |
1 · x1 + 1 · x2
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.1.1.2.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
cons#(X1,mark(X2)) |
→ |
cons#(X1,X2) |
(60) |
|
1 |
≥ |
1 |
2 |
> |
2 |
cons#(mark(X1),X2) |
→ |
cons#(X1,X2) |
(59) |
|
1 |
> |
1 |
2 |
≥ |
2 |
cons#(active(X1),X2) |
→ |
cons#(X1,X2) |
(61) |
|
1 |
> |
1 |
2 |
≥ |
2 |
cons#(X1,active(X2)) |
→ |
cons#(X1,X2) |
(62) |
|
1 |
≥ |
1 |
2 |
> |
2 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
3rd
component contains the
pair
incr#(active(X)) |
→ |
incr#(X) |
(64) |
incr#(mark(X)) |
→ |
incr#(X) |
(63) |
1.1.1.1.3 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[incr#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.1.1.3.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
incr#(active(X)) |
→ |
incr#(X) |
(64) |
|
1 |
> |
1 |
incr#(mark(X)) |
→ |
incr#(X) |
(63) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
4th
component contains the
pair
s#(active(X)) |
→ |
s#(X) |
(66) |
s#(mark(X)) |
→ |
s#(X) |
(65) |
1.1.1.1.4 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[s#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.1.1.4.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
s#(active(X)) |
→ |
s#(X) |
(66) |
|
1 |
> |
1 |
s#(mark(X)) |
→ |
s#(X) |
(65) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
5th
component contains the
pair
head#(active(X)) |
→ |
head#(X) |
(68) |
head#(mark(X)) |
→ |
head#(X) |
(67) |
1.1.1.1.5 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[head#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.1.1.5.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
head#(active(X)) |
→ |
head#(X) |
(68) |
|
1 |
> |
1 |
head#(mark(X)) |
→ |
head#(X) |
(67) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
6th
component contains the
pair
tail#(active(X)) |
→ |
tail#(X) |
(70) |
tail#(mark(X)) |
→ |
tail#(X) |
(69) |
1.1.1.1.6 Monotonic Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the naturals
[active(x1)] |
= |
1 · x1
|
[mark(x1)] |
= |
1 · x1
|
[tail#(x1)] |
= |
1 · x1
|
having no usable rules (w.r.t. the implicit argument filter of the
reduction pair),
the
rule
could be deleted.
1.1.1.1.6.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
tail#(active(X)) |
→ |
tail#(X) |
(70) |
|
1 |
> |
1 |
tail#(mark(X)) |
→ |
tail#(X) |
(69) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.