The rewrite relation of the following TRS is considered.
[cons(x1, x2)] |
= |
· x1 + · x2 +
|
[s(x1)] |
= |
· x1 +
|
[active(x1)] |
= |
· x1 +
|
[incr(x1)] |
= |
· x1 +
|
[mark(x1)] |
= |
· x1 +
|
[tail(x1)] |
= |
· x1 +
|
[nats] |
= |
|
[odds] |
= |
|
[ok(x1)] |
= |
· x1 +
|
[proper(x1)] |
= |
· x1 +
|
[head(x1)] |
= |
· x1 +
|
[top(x1)] |
= |
· x1 +
|
[pairs] |
= |
|
[0] |
= |
|
all of the following rules can be deleted.
[cons(x1, x2)] |
= |
· x1 + · x2 +
|
[s(x1)] |
= |
· x1 +
|
[active(x1)] |
= |
· x1 +
|
[incr(x1)] |
= |
· x1 +
|
[mark(x1)] |
= |
· x1 +
|
[tail(x1)] |
= |
· x1 +
|
[nats] |
= |
|
[odds] |
= |
|
[ok(x1)] |
= |
· x1 +
|
[proper(x1)] |
= |
· x1 +
|
[head(x1)] |
= |
· x1 +
|
[top(x1)] |
= |
· x1 +
|
[pairs] |
= |
|
[0] |
= |
|
all of the following rules can be deleted.
[cons(x1, x2)] |
= |
· x1 + · x2 +
|
[s(x1)] |
= |
· x1 +
|
[active(x1)] |
= |
· x1 +
|
[incr(x1)] |
= |
· x1 +
|
[mark(x1)] |
= |
· x1 +
|
[tail(x1)] |
= |
· x1 +
|
[nats] |
= |
|
[odds] |
= |
|
[ok(x1)] |
= |
· x1 +
|
[proper(x1)] |
= |
· x1 +
|
[head(x1)] |
= |
· x1 +
|
[top(x1)] |
= |
· x1 +
|
[pairs] |
= |
|
[0] |
= |
|
all of the following rules can be deleted.
The dependency pairs are split into 8
components.
-
The
1st
component contains the
pair
top#(ok(X)) |
→ |
top#(active(X)) |
(73) |
top#(mark(X)) |
→ |
top#(proper(X)) |
(71) |
1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the
prec(top#) |
= |
0 |
|
stat(top#) |
= |
lex
|
prec(ok) |
= |
0 |
|
stat(ok) |
= |
lex
|
prec(proper) |
= |
0 |
|
stat(proper) |
= |
lex
|
prec(tail) |
= |
1 |
|
stat(tail) |
= |
lex
|
prec(head) |
= |
0 |
|
stat(head) |
= |
lex
|
prec(s) |
= |
0 |
|
stat(s) |
= |
lex
|
prec(odds) |
= |
3 |
|
stat(odds) |
= |
lex
|
prec(pairs) |
= |
2 |
|
stat(pairs) |
= |
lex
|
prec(mark) |
= |
0 |
|
stat(mark) |
= |
lex
|
prec(cons) |
= |
0 |
|
stat(cons) |
= |
lex
|
prec(incr) |
= |
2 |
|
stat(incr) |
= |
lex
|
prec(0) |
= |
0 |
|
stat(0) |
= |
lex
|
prec(active) |
= |
0 |
|
stat(active) |
= |
lex
|
prec(nats) |
= |
0 |
|
stat(nats) |
= |
lex
|
π(top#) |
= |
1 |
π(ok) |
= |
1 |
π(proper) |
= |
1 |
π(tail) |
= |
[1] |
π(head) |
= |
1 |
π(s) |
= |
1 |
π(odds) |
= |
[] |
π(pairs) |
= |
[] |
π(mark) |
= |
[1] |
π(cons) |
= |
1 |
π(incr) |
= |
[1] |
π(0) |
= |
[] |
π(active) |
= |
1 |
π(nats) |
= |
[] |
together with the usable
rules
active(pairs) |
→ |
mark(cons(0,incr(odds))) |
(2) |
active(odds) |
→ |
mark(incr(pairs)) |
(3) |
active(incr(cons(X,XS))) |
→ |
mark(cons(s(X),incr(XS))) |
(4) |
active(cons(X1,X2)) |
→ |
cons(active(X1),X2) |
(7) |
active(incr(X)) |
→ |
incr(active(X)) |
(8) |
active(s(X)) |
→ |
s(active(X)) |
(9) |
active(head(X)) |
→ |
head(active(X)) |
(10) |
active(tail(X)) |
→ |
tail(active(X)) |
(11) |
incr(mark(X)) |
→ |
mark(incr(X)) |
(13) |
incr(ok(X)) |
→ |
ok(incr(X)) |
(27) |
s(mark(X)) |
→ |
mark(s(X)) |
(14) |
s(ok(X)) |
→ |
ok(s(X)) |
(28) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(12) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(26) |
head(mark(X)) |
→ |
mark(head(X)) |
(15) |
head(ok(X)) |
→ |
ok(head(X)) |
(29) |
tail(mark(X)) |
→ |
mark(tail(X)) |
(16) |
tail(ok(X)) |
→ |
ok(tail(X)) |
(30) |
proper(nats) |
→ |
ok(nats) |
(17) |
proper(cons(X1,X2)) |
→ |
cons(proper(X1),proper(X2)) |
(18) |
proper(0) |
→ |
ok(0) |
(19) |
proper(incr(X)) |
→ |
incr(proper(X)) |
(20) |
proper(pairs) |
→ |
ok(pairs) |
(21) |
proper(odds) |
→ |
ok(odds) |
(22) |
proper(s(X)) |
→ |
s(proper(X)) |
(23) |
proper(head(X)) |
→ |
head(proper(X)) |
(24) |
proper(tail(X)) |
→ |
tail(proper(X)) |
(25) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
top#(mark(X)) |
→ |
top#(proper(X)) |
(71) |
could be deleted.
1.1.1.1.1.1.1 Reduction Pair Processor with Usable Rules
Using the
prec(top#) |
= |
0 |
|
stat(top#) |
= |
lex
|
prec(ok) |
= |
0 |
|
stat(ok) |
= |
lex
|
prec(tail) |
= |
0 |
|
stat(tail) |
= |
lex
|
prec(head) |
= |
0 |
|
stat(head) |
= |
lex
|
prec(s) |
= |
0 |
|
stat(s) |
= |
lex
|
prec(odds) |
= |
2 |
|
stat(odds) |
= |
lex
|
prec(pairs) |
= |
1 |
|
stat(pairs) |
= |
lex
|
prec(mark) |
= |
0 |
|
stat(mark) |
= |
lex
|
prec(cons) |
= |
0 |
|
stat(cons) |
= |
lex
|
prec(incr) |
= |
0 |
|
stat(incr) |
= |
lex
|
prec(0) |
= |
0 |
|
stat(0) |
= |
lex
|
prec(active) |
= |
0 |
|
stat(active) |
= |
lex
|
π(top#) |
= |
1 |
π(ok) |
= |
[1] |
π(tail) |
= |
1 |
π(head) |
= |
1 |
π(s) |
= |
1 |
π(odds) |
= |
[] |
π(pairs) |
= |
[] |
π(mark) |
= |
1 |
π(cons) |
= |
1 |
π(incr) |
= |
1 |
π(0) |
= |
[] |
π(active) |
= |
1 |
together with the usable
rules
active(pairs) |
→ |
mark(cons(0,incr(odds))) |
(2) |
active(odds) |
→ |
mark(incr(pairs)) |
(3) |
active(incr(cons(X,XS))) |
→ |
mark(cons(s(X),incr(XS))) |
(4) |
active(cons(X1,X2)) |
→ |
cons(active(X1),X2) |
(7) |
active(incr(X)) |
→ |
incr(active(X)) |
(8) |
active(s(X)) |
→ |
s(active(X)) |
(9) |
active(head(X)) |
→ |
head(active(X)) |
(10) |
active(tail(X)) |
→ |
tail(active(X)) |
(11) |
incr(mark(X)) |
→ |
mark(incr(X)) |
(13) |
incr(ok(X)) |
→ |
ok(incr(X)) |
(27) |
s(mark(X)) |
→ |
mark(s(X)) |
(14) |
s(ok(X)) |
→ |
ok(s(X)) |
(28) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(12) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(26) |
head(mark(X)) |
→ |
mark(head(X)) |
(15) |
head(ok(X)) |
→ |
ok(head(X)) |
(29) |
tail(mark(X)) |
→ |
mark(tail(X)) |
(16) |
tail(ok(X)) |
→ |
ok(tail(X)) |
(30) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
top#(ok(X)) |
→ |
top#(active(X)) |
(73) |
could be deleted.
1.1.1.1.1.1.1.1 P is empty
There are no pairs anymore.
-
The
2nd
component contains the
pair
proper#(tail(X)) |
→ |
proper#(X) |
(63) |
proper#(head(X)) |
→ |
proper#(X) |
(61) |
proper#(s(X)) |
→ |
proper#(X) |
(59) |
proper#(incr(X)) |
→ |
proper#(X) |
(57) |
proper#(cons(X1,X2)) |
→ |
proper#(X1) |
(55) |
proper#(cons(X1,X2)) |
→ |
proper#(X2) |
(54) |
1.1.1.1.1.2 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
proper#(tail(X)) |
→ |
proper#(X) |
(63) |
|
1 |
> |
1 |
proper#(head(X)) |
→ |
proper#(X) |
(61) |
|
1 |
> |
1 |
proper#(s(X)) |
→ |
proper#(X) |
(59) |
|
1 |
> |
1 |
proper#(incr(X)) |
→ |
proper#(X) |
(57) |
|
1 |
> |
1 |
proper#(cons(X1,X2)) |
→ |
proper#(X1) |
(55) |
|
1 |
> |
1 |
proper#(cons(X1,X2)) |
→ |
proper#(X2) |
(54) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
3rd
component contains the
pair
active#(tail(X)) |
→ |
active#(X) |
(47) |
active#(head(X)) |
→ |
active#(X) |
(45) |
active#(s(X)) |
→ |
active#(X) |
(43) |
active#(incr(X)) |
→ |
active#(X) |
(41) |
active#(cons(X1,X2)) |
→ |
active#(X1) |
(39) |
1.1.1.1.1.3 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
active#(tail(X)) |
→ |
active#(X) |
(47) |
|
1 |
> |
1 |
active#(head(X)) |
→ |
active#(X) |
(45) |
|
1 |
> |
1 |
active#(s(X)) |
→ |
active#(X) |
(43) |
|
1 |
> |
1 |
active#(incr(X)) |
→ |
active#(X) |
(41) |
|
1 |
> |
1 |
active#(cons(X1,X2)) |
→ |
active#(X1) |
(39) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
4th
component contains the
pair
cons#(ok(X1),ok(X2)) |
→ |
cons#(X1,X2) |
(65) |
cons#(mark(X1),X2) |
→ |
cons#(X1,X2) |
(49) |
1.1.1.1.1.4 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
cons#(ok(X1),ok(X2)) |
→ |
cons#(X1,X2) |
(65) |
|
2 |
> |
2 |
1 |
> |
1 |
cons#(mark(X1),X2) |
→ |
cons#(X1,X2) |
(49) |
|
2 |
≥ |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
5th
component contains the
pair
incr#(ok(X)) |
→ |
incr#(X) |
(66) |
incr#(mark(X)) |
→ |
incr#(X) |
(50) |
1.1.1.1.1.5 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
incr#(ok(X)) |
→ |
incr#(X) |
(66) |
|
1 |
> |
1 |
incr#(mark(X)) |
→ |
incr#(X) |
(50) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
6th
component contains the
pair
s#(ok(X)) |
→ |
s#(X) |
(67) |
s#(mark(X)) |
→ |
s#(X) |
(51) |
1.1.1.1.1.6 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
s#(ok(X)) |
→ |
s#(X) |
(67) |
|
1 |
> |
1 |
s#(mark(X)) |
→ |
s#(X) |
(51) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
7th
component contains the
pair
head#(ok(X)) |
→ |
head#(X) |
(68) |
head#(mark(X)) |
→ |
head#(X) |
(52) |
1.1.1.1.1.7 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
head#(ok(X)) |
→ |
head#(X) |
(68) |
|
1 |
> |
1 |
head#(mark(X)) |
→ |
head#(X) |
(52) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
8th
component contains the
pair
tail#(ok(X)) |
→ |
tail#(X) |
(69) |
tail#(mark(X)) |
→ |
tail#(X) |
(53) |
1.1.1.1.1.8 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
tail#(ok(X)) |
→ |
tail#(X) |
(69) |
|
1 |
> |
1 |
tail#(mark(X)) |
→ |
tail#(X) |
(53) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.