The rewrite relation of the following TRS is considered.
The dependency pairs are split into 8
components.
-
The
1st
component contains the
pair
top#(ok(X)) |
→ |
top#(active(X)) |
(59) |
top#(mark(X)) |
→ |
top#(proper(X)) |
(57) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over (3 x 3)-matrices with strict dimension 1
over the naturals
[mark(x1)] |
= |
· x1 +
|
[length1(x1)] |
= |
· x1 +
|
[active(x1)] |
= |
· x1 +
|
[cons(x1, x2)] |
= |
· x1 + · x2 +
|
[top#(x1)] |
= |
· x1 +
|
[nil] |
= |
|
[ok(x1)] |
= |
· x1 +
|
[from(x1)] |
= |
· x1 +
|
[0] |
= |
|
[proper(x1)] |
= |
· x1 +
|
[length(x1)] |
= |
· x1 +
|
[s(x1)] |
= |
· x1 +
|
together with the usable
rules
active(from(X)) |
→ |
mark(cons(X,from(s(X)))) |
(1) |
active(length(nil)) |
→ |
mark(0) |
(2) |
active(length(cons(X,Y))) |
→ |
mark(s(length1(Y))) |
(3) |
active(length1(X)) |
→ |
mark(length(X)) |
(4) |
active(from(X)) |
→ |
from(active(X)) |
(5) |
active(cons(X1,X2)) |
→ |
cons(active(X1),X2) |
(6) |
active(s(X)) |
→ |
s(active(X)) |
(7) |
s(mark(X)) |
→ |
mark(s(X)) |
(10) |
s(ok(X)) |
→ |
ok(s(X)) |
(20) |
from(mark(X)) |
→ |
mark(from(X)) |
(8) |
from(ok(X)) |
→ |
ok(from(X)) |
(18) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(9) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(19) |
length1(ok(X)) |
→ |
ok(length1(X)) |
(22) |
length(ok(X)) |
→ |
ok(length(X)) |
(21) |
proper(from(X)) |
→ |
from(proper(X)) |
(11) |
proper(cons(X1,X2)) |
→ |
cons(proper(X1),proper(X2)) |
(12) |
proper(s(X)) |
→ |
s(proper(X)) |
(13) |
proper(length(X)) |
→ |
length(proper(X)) |
(14) |
proper(nil) |
→ |
ok(nil) |
(15) |
proper(0) |
→ |
ok(0) |
(16) |
proper(length1(X)) |
→ |
length1(proper(X)) |
(17) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
top#(mark(X)) |
→ |
top#(proper(X)) |
(57) |
could be deleted.
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(length1) |
= |
1 |
|
stat(length1) |
= |
lex
|
prec(0) |
= |
0 |
|
stat(0) |
= |
lex
|
prec(length) |
= |
1 |
|
stat(length) |
= |
lex
|
prec(nil) |
= |
0 |
|
stat(nil) |
= |
lex
|
prec(mark) |
= |
0 |
|
stat(mark) |
= |
lex
|
prec(cons) |
= |
0 |
|
stat(cons) |
= |
lex
|
prec(s) |
= |
0 |
|
stat(s) |
= |
lex
|
prec(active) |
= |
0 |
|
stat(active) |
= |
lex
|
prec(from) |
= |
1 |
|
stat(from) |
= |
lex
|
π(top#) |
= |
1 |
π(ok) |
= |
[1] |
π(length1) |
= |
[] |
π(0) |
= |
[] |
π(length) |
= |
[] |
π(nil) |
= |
[] |
π(mark) |
= |
[] |
π(cons) |
= |
1 |
π(s) |
= |
1 |
π(active) |
= |
1 |
π(from) |
= |
[1] |
together with the usable
rules
active(from(X)) |
→ |
mark(cons(X,from(s(X)))) |
(1) |
active(length(nil)) |
→ |
mark(0) |
(2) |
active(length(cons(X,Y))) |
→ |
mark(s(length1(Y))) |
(3) |
active(length1(X)) |
→ |
mark(length(X)) |
(4) |
active(from(X)) |
→ |
from(active(X)) |
(5) |
active(cons(X1,X2)) |
→ |
cons(active(X1),X2) |
(6) |
active(s(X)) |
→ |
s(active(X)) |
(7) |
s(mark(X)) |
→ |
mark(s(X)) |
(10) |
s(ok(X)) |
→ |
ok(s(X)) |
(20) |
from(mark(X)) |
→ |
mark(from(X)) |
(8) |
from(ok(X)) |
→ |
ok(from(X)) |
(18) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(9) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(19) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
top#(ok(X)) |
→ |
top#(active(X)) |
(59) |
could be deleted.
1.1.1.1.1 P is empty
There are no pairs anymore.
-
The
2nd
component contains the
pair
proper#(length1(X)) |
→ |
proper#(X) |
(49) |
proper#(length(X)) |
→ |
proper#(X) |
(47) |
proper#(s(X)) |
→ |
proper#(X) |
(45) |
proper#(cons(X1,X2)) |
→ |
proper#(X1) |
(43) |
proper#(cons(X1,X2)) |
→ |
proper#(X2) |
(42) |
proper#(from(X)) |
→ |
proper#(X) |
(40) |
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#(length1(X)) |
→ |
proper#(X) |
(49) |
|
1 |
> |
1 |
proper#(length(X)) |
→ |
proper#(X) |
(47) |
|
1 |
> |
1 |
proper#(s(X)) |
→ |
proper#(X) |
(45) |
|
1 |
> |
1 |
proper#(cons(X1,X2)) |
→ |
proper#(X1) |
(43) |
|
1 |
> |
1 |
proper#(cons(X1,X2)) |
→ |
proper#(X2) |
(42) |
|
1 |
> |
1 |
proper#(from(X)) |
→ |
proper#(X) |
(40) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
3rd
component contains the
pair
active#(s(X)) |
→ |
active#(X) |
(35) |
active#(cons(X1,X2)) |
→ |
active#(X1) |
(33) |
active#(from(X)) |
→ |
active#(X) |
(31) |
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#(s(X)) |
→ |
active#(X) |
(35) |
|
1 |
> |
1 |
active#(cons(X1,X2)) |
→ |
active#(X1) |
(33) |
|
1 |
> |
1 |
active#(from(X)) |
→ |
active#(X) |
(31) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
4th
component contains the
pair
length1#(ok(X)) |
→ |
length1#(X) |
(55) |
1.1.4 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
length1#(ok(X)) |
→ |
length1#(X) |
(55) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
5th
component contains the
pair
length#(ok(X)) |
→ |
length#(X) |
(54) |
1.1.5 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
length#(ok(X)) |
→ |
length#(X) |
(54) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
6th
component contains the
pair
from#(ok(X)) |
→ |
from#(X) |
(51) |
from#(mark(X)) |
→ |
from#(X) |
(37) |
1.1.6 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
from#(ok(X)) |
→ |
from#(X) |
(51) |
|
1 |
> |
1 |
from#(mark(X)) |
→ |
from#(X) |
(37) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
7th
component contains the
pair
cons#(ok(X1),ok(X2)) |
→ |
cons#(X1,X2) |
(52) |
cons#(mark(X1),X2) |
→ |
cons#(X1,X2) |
(38) |
1.1.7 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) |
(52) |
|
2 |
> |
2 |
1 |
> |
1 |
cons#(mark(X1),X2) |
→ |
cons#(X1,X2) |
(38) |
|
2 |
≥ |
2 |
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.
-
The
8th
component contains the
pair
s#(ok(X)) |
→ |
s#(X) |
(53) |
s#(mark(X)) |
→ |
s#(X) |
(39) |
1.1.8 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) |
(53) |
|
1 |
> |
1 |
s#(mark(X)) |
→ |
s#(X) |
(39) |
|
1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.