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)) |
(65) |
top#(mark(X)) |
→ |
top#(proper(X)) |
(31) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the argument filter
π(top#) |
= |
1 |
π(proper) |
= |
1 |
π(ok) |
= |
1 |
π(s#) |
= |
1 |
π(f#) |
= |
1 |
π(proper#) |
= |
1 |
π(active) |
= |
1 |
in combination with the following Weighted Path Order with the following precedence and status
prec(cons#) |
= |
0 |
|
status(cons#) |
= |
[2] |
|
list-extension(cons#) |
= |
Lex |
prec(s) |
= |
5 |
|
status(s) |
= |
[1] |
|
list-extension(s) |
= |
Lex |
prec(top) |
= |
0 |
|
status(top) |
= |
[] |
|
list-extension(top) |
= |
Lex |
prec(f) |
= |
6 |
|
status(f) |
= |
[1] |
|
list-extension(f) |
= |
Lex |
prec(0) |
= |
0 |
|
status(0) |
= |
[] |
|
list-extension(0) |
= |
Lex |
prec(sel#) |
= |
0 |
|
status(sel#) |
= |
[2, 1] |
|
list-extension(sel#) |
= |
Lex |
prec(sel) |
= |
3 |
|
status(sel) |
= |
[1, 2] |
|
list-extension(sel) |
= |
Lex |
prec(mark) |
= |
2 |
|
status(mark) |
= |
[1] |
|
list-extension(mark) |
= |
Lex |
prec(g#) |
= |
0 |
|
status(g#) |
= |
[] |
|
list-extension(g#) |
= |
Lex |
prec(cons) |
= |
4 |
|
status(cons) |
= |
[1] |
|
list-extension(cons) |
= |
Lex |
prec(active#) |
= |
0 |
|
status(active#) |
= |
[] |
|
list-extension(active#) |
= |
Lex |
prec(g) |
= |
6 |
|
status(g) |
= |
[1] |
|
list-extension(g) |
= |
Lex |
and the following
Max-polynomial interpretation
[cons#(x1, x2)] |
=
|
max(x2 + 1, 0) |
[s(x1)] |
=
|
x1 + 0 |
[top(x1)] |
=
|
1 |
[f(x1)] |
=
|
x1 + 52184 |
[0] |
=
|
17888 |
[sel#(x1, x2)] |
=
|
x1 + x2 + 1 |
[sel(x1, x2)] |
=
|
x1 + x2 + 1 |
[mark(x1)] |
=
|
x1 + 0 |
[g#(x1)] |
=
|
1 |
[cons(x1, x2)] |
=
|
max(x1 + 20586, x2 + 0, 0) |
[active#(x1)] |
=
|
1 |
[g(x1)] |
=
|
x1 + 0 |
together with the usable
rules
proper(f(X)) |
→ |
f(proper(X)) |
(18) |
active(sel(0,cons(X,Y))) |
→ |
mark(X) |
(4) |
s(mark(X)) |
→ |
mark(s(X)) |
(15) |
active(g(X)) |
→ |
g(active(X)) |
(8) |
active(f(X)) |
→ |
mark(cons(X,f(g(X)))) |
(1) |
active(g(s(X))) |
→ |
mark(s(s(g(X)))) |
(3) |
sel(mark(X1),X2) |
→ |
mark(sel(X1,X2)) |
(16) |
proper(0) |
→ |
ok(0) |
(21) |
g(ok(X)) |
→ |
ok(g(X)) |
(26) |
proper(cons(X1,X2)) |
→ |
cons(proper(X1),proper(X2)) |
(19) |
sel(X1,mark(X2)) |
→ |
mark(sel(X1,X2)) |
(17) |
s(ok(X)) |
→ |
ok(s(X)) |
(27) |
proper(s(X)) |
→ |
s(proper(X)) |
(22) |
sel(ok(X1),ok(X2)) |
→ |
ok(sel(X1,X2)) |
(28) |
active(sel(s(X),cons(Y,Z))) |
→ |
mark(sel(X,Z)) |
(5) |
active(sel(X1,X2)) |
→ |
sel(active(X1),X2) |
(10) |
active(cons(X1,X2)) |
→ |
cons(active(X1),X2) |
(7) |
proper(g(X)) |
→ |
g(proper(X)) |
(20) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(25) |
g(mark(X)) |
→ |
mark(g(X)) |
(14) |
f(mark(X)) |
→ |
mark(f(X)) |
(12) |
proper(sel(X1,X2)) |
→ |
sel(proper(X1),proper(X2)) |
(23) |
f(ok(X)) |
→ |
ok(f(X)) |
(24) |
active(sel(X1,X2)) |
→ |
sel(X1,active(X2)) |
(11) |
active(s(X)) |
→ |
s(active(X)) |
(9) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(13) |
active(f(X)) |
→ |
f(active(X)) |
(6) |
active(g(0)) |
→ |
mark(s(0)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
top#(mark(X)) |
→ |
top#(proper(X)) |
(31) |
could be deleted.
1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.
-
The
2nd
component contains the
pair
proper#(sel(X1,X2)) |
→ |
proper#(X2) |
(51) |
proper#(g(X)) |
→ |
proper#(X) |
(70) |
proper#(sel(X1,X2)) |
→ |
proper#(X1) |
(43) |
proper#(cons(X1,X2)) |
→ |
proper#(X2) |
(63) |
proper#(f(X)) |
→ |
proper#(X) |
(39) |
proper#(cons(X1,X2)) |
→ |
proper#(X1) |
(58) |
proper#(s(X)) |
→ |
proper#(X) |
(33) |
1.1.2 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
[cons#(x1, x2)] |
=
|
0 |
[s(x1)] |
=
|
x1 + 1 |
[top(x1)] |
=
|
0 |
[top#(x1)] |
=
|
0 |
[f(x1)] |
=
|
x1 + 1 |
[proper(x1)] |
=
|
x1 + 36435 |
[ok(x1)] |
=
|
x1 + 9507 |
[0] |
=
|
1 |
[sel#(x1, x2)] |
=
|
0 |
[sel(x1, x2)] |
=
|
x1 + x2 + 1 |
[s#(x1)] |
=
|
0 |
[mark(x1)] |
=
|
x1 + 0 |
[f#(x1)] |
=
|
0 |
[g#(x1)] |
=
|
0 |
[proper#(x1)] |
=
|
x1 + 0 |
[active(x1)] |
=
|
21655 |
[cons(x1, x2)] |
=
|
x1 + x2 + 21653 |
[active#(x1)] |
=
|
0 |
[g(x1)] |
=
|
x1 + 1 |
together with the usable
rules
s(mark(X)) |
→ |
mark(s(X)) |
(15) |
sel(mark(X1),X2) |
→ |
mark(sel(X1,X2)) |
(16) |
proper(0) |
→ |
ok(0) |
(21) |
g(ok(X)) |
→ |
ok(g(X)) |
(26) |
sel(X1,mark(X2)) |
→ |
mark(sel(X1,X2)) |
(17) |
s(ok(X)) |
→ |
ok(s(X)) |
(27) |
sel(ok(X1),ok(X2)) |
→ |
ok(sel(X1,X2)) |
(28) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(25) |
g(mark(X)) |
→ |
mark(g(X)) |
(14) |
f(mark(X)) |
→ |
mark(f(X)) |
(12) |
f(ok(X)) |
→ |
ok(f(X)) |
(24) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(13) |
active(g(0)) |
→ |
mark(s(0)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
proper#(sel(X1,X2)) |
→ |
proper#(X2) |
(51) |
proper#(g(X)) |
→ |
proper#(X) |
(70) |
proper#(sel(X1,X2)) |
→ |
proper#(X1) |
(43) |
proper#(cons(X1,X2)) |
→ |
proper#(X2) |
(63) |
proper#(f(X)) |
→ |
proper#(X) |
(39) |
proper#(cons(X1,X2)) |
→ |
proper#(X1) |
(58) |
proper#(s(X)) |
→ |
proper#(X) |
(33) |
could be deleted.
1.1.2.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
3rd
component contains the
pair
active#(sel(X1,X2)) |
→ |
active#(X1) |
(53) |
active#(s(X)) |
→ |
active#(X) |
(74) |
active#(cons(X1,X2)) |
→ |
active#(X1) |
(47) |
active#(g(X)) |
→ |
active#(X) |
(60) |
active#(f(X)) |
→ |
active#(X) |
(59) |
active#(sel(X1,X2)) |
→ |
active#(X2) |
(57) |
1.1.3 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
[cons#(x1, x2)] |
=
|
0 |
[s(x1)] |
=
|
x1 + 1 |
[top(x1)] |
=
|
0 |
[top#(x1)] |
=
|
0 |
[f(x1)] |
=
|
x1 + 1 |
[proper(x1)] |
=
|
x1 + 1 |
[ok(x1)] |
=
|
x1 + 1 |
[0] |
=
|
2 |
[sel#(x1, x2)] |
=
|
0 |
[sel(x1, x2)] |
=
|
x1 + x2 + 2 |
[s#(x1)] |
=
|
0 |
[mark(x1)] |
=
|
x1 + 0 |
[f#(x1)] |
=
|
0 |
[g#(x1)] |
=
|
0 |
[proper#(x1)] |
=
|
0 |
[active(x1)] |
=
|
3 |
[cons(x1, x2)] |
=
|
x1 + x2 + 1 |
[active#(x1)] |
=
|
x1 + 0 |
[g(x1)] |
=
|
x1 + 1 |
together with the usable
rules
s(mark(X)) |
→ |
mark(s(X)) |
(15) |
sel(mark(X1),X2) |
→ |
mark(sel(X1,X2)) |
(16) |
proper(0) |
→ |
ok(0) |
(21) |
g(ok(X)) |
→ |
ok(g(X)) |
(26) |
sel(X1,mark(X2)) |
→ |
mark(sel(X1,X2)) |
(17) |
s(ok(X)) |
→ |
ok(s(X)) |
(27) |
sel(ok(X1),ok(X2)) |
→ |
ok(sel(X1,X2)) |
(28) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(25) |
g(mark(X)) |
→ |
mark(g(X)) |
(14) |
f(mark(X)) |
→ |
mark(f(X)) |
(12) |
f(ok(X)) |
→ |
ok(f(X)) |
(24) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(13) |
active(g(0)) |
→ |
mark(s(0)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
active#(sel(X1,X2)) |
→ |
active#(X1) |
(53) |
active#(s(X)) |
→ |
active#(X) |
(74) |
active#(cons(X1,X2)) |
→ |
active#(X1) |
(47) |
active#(g(X)) |
→ |
active#(X) |
(60) |
active#(f(X)) |
→ |
active#(X) |
(59) |
active#(sel(X1,X2)) |
→ |
active#(X2) |
(57) |
could be deleted.
1.1.3.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
4th
component contains the
pair
sel#(X1,mark(X2)) |
→ |
sel#(X1,X2) |
(50) |
sel#(mark(X1),X2) |
→ |
sel#(X1,X2) |
(69) |
sel#(ok(X1),ok(X2)) |
→ |
sel#(X1,X2) |
(64) |
1.1.4 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
[cons#(x1, x2)] |
=
|
0 |
[s(x1)] |
=
|
x1 + 1 |
[top(x1)] |
=
|
0 |
[top#(x1)] |
=
|
0 |
[f(x1)] |
=
|
x1 + 1 |
[proper(x1)] |
=
|
x1 + 1 |
[ok(x1)] |
=
|
x1 + 1 |
[0] |
=
|
681 |
[sel#(x1, x2)] |
=
|
x2 + 0 |
[sel(x1, x2)] |
=
|
x1 + x2 + 1 |
[s#(x1)] |
=
|
0 |
[mark(x1)] |
=
|
x1 + 0 |
[f#(x1)] |
=
|
0 |
[g#(x1)] |
=
|
0 |
[proper#(x1)] |
=
|
0 |
[active(x1)] |
=
|
15263 |
[cons(x1, x2)] |
=
|
x1 + x2 + 1 |
[active#(x1)] |
=
|
0 |
[g(x1)] |
=
|
x1 + 15261 |
together with the usable
rules
s(mark(X)) |
→ |
mark(s(X)) |
(15) |
sel(mark(X1),X2) |
→ |
mark(sel(X1,X2)) |
(16) |
proper(0) |
→ |
ok(0) |
(21) |
g(ok(X)) |
→ |
ok(g(X)) |
(26) |
sel(X1,mark(X2)) |
→ |
mark(sel(X1,X2)) |
(17) |
s(ok(X)) |
→ |
ok(s(X)) |
(27) |
sel(ok(X1),ok(X2)) |
→ |
ok(sel(X1,X2)) |
(28) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(25) |
g(mark(X)) |
→ |
mark(g(X)) |
(14) |
f(mark(X)) |
→ |
mark(f(X)) |
(12) |
f(ok(X)) |
→ |
ok(f(X)) |
(24) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(13) |
active(g(0)) |
→ |
mark(s(0)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
sel#(ok(X1),ok(X2)) |
→ |
sel#(X1,X2) |
(64) |
could be deleted.
1.1.4.1 Dependency Graph Processor
The dependency pairs are split into 1
component.
-
The
5th
component contains the
pair
s#(ok(X)) |
→ |
s#(X) |
(52) |
s#(mark(X)) |
→ |
s#(X) |
(48) |
1.1.5 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
[cons#(x1, x2)] |
=
|
0 |
[s(x1)] |
=
|
x1 + 1 |
[top(x1)] |
=
|
0 |
[top#(x1)] |
=
|
0 |
[f(x1)] |
=
|
x1 + 1 |
[proper(x1)] |
=
|
x1 + 1 |
[ok(x1)] |
=
|
x1 + 1 |
[0] |
=
|
1 |
[sel#(x1, x2)] |
=
|
0 |
[sel(x1, x2)] |
=
|
x1 + x2 + 1 |
[s#(x1)] |
=
|
x1 + 0 |
[mark(x1)] |
=
|
x1 + 1 |
[f#(x1)] |
=
|
0 |
[g#(x1)] |
=
|
0 |
[proper#(x1)] |
=
|
0 |
[active(x1)] |
=
|
4 |
[cons(x1, x2)] |
=
|
x1 + x2 + 1 |
[active#(x1)] |
=
|
0 |
[g(x1)] |
=
|
x1 + 1 |
together with the usable
rules
s(mark(X)) |
→ |
mark(s(X)) |
(15) |
sel(mark(X1),X2) |
→ |
mark(sel(X1,X2)) |
(16) |
proper(0) |
→ |
ok(0) |
(21) |
g(ok(X)) |
→ |
ok(g(X)) |
(26) |
sel(X1,mark(X2)) |
→ |
mark(sel(X1,X2)) |
(17) |
s(ok(X)) |
→ |
ok(s(X)) |
(27) |
sel(ok(X1),ok(X2)) |
→ |
ok(sel(X1,X2)) |
(28) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(25) |
g(mark(X)) |
→ |
mark(g(X)) |
(14) |
f(mark(X)) |
→ |
mark(f(X)) |
(12) |
f(ok(X)) |
→ |
ok(f(X)) |
(24) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(13) |
active(g(0)) |
→ |
mark(s(0)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
s#(ok(X)) |
→ |
s#(X) |
(52) |
s#(mark(X)) |
→ |
s#(X) |
(48) |
could be deleted.
1.1.5.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
6th
component contains the
pair
cons#(ok(X1),ok(X2)) |
→ |
cons#(X1,X2) |
(67) |
cons#(mark(X1),X2) |
→ |
cons#(X1,X2) |
(41) |
1.1.6 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
[cons#(x1, x2)] |
=
|
x2 + 0 |
[s(x1)] |
=
|
x1 + 1 |
[top(x1)] |
=
|
0 |
[top#(x1)] |
=
|
0 |
[f(x1)] |
=
|
x1 + 1 |
[proper(x1)] |
=
|
x1 + 1 |
[ok(x1)] |
=
|
x1 + 1 |
[0] |
=
|
1 |
[sel#(x1, x2)] |
=
|
0 |
[sel(x1, x2)] |
=
|
x1 + x2 + 2 |
[s#(x1)] |
=
|
0 |
[mark(x1)] |
=
|
x1 + 1 |
[f#(x1)] |
=
|
0 |
[g#(x1)] |
=
|
0 |
[proper#(x1)] |
=
|
0 |
[active(x1)] |
=
|
4 |
[cons(x1, x2)] |
=
|
x1 + x2 + 1 |
[active#(x1)] |
=
|
0 |
[g(x1)] |
=
|
x1 + 1 |
together with the usable
rules
s(mark(X)) |
→ |
mark(s(X)) |
(15) |
sel(mark(X1),X2) |
→ |
mark(sel(X1,X2)) |
(16) |
proper(0) |
→ |
ok(0) |
(21) |
g(ok(X)) |
→ |
ok(g(X)) |
(26) |
sel(X1,mark(X2)) |
→ |
mark(sel(X1,X2)) |
(17) |
s(ok(X)) |
→ |
ok(s(X)) |
(27) |
sel(ok(X1),ok(X2)) |
→ |
ok(sel(X1,X2)) |
(28) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(25) |
g(mark(X)) |
→ |
mark(g(X)) |
(14) |
f(mark(X)) |
→ |
mark(f(X)) |
(12) |
f(ok(X)) |
→ |
ok(f(X)) |
(24) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(13) |
active(g(0)) |
→ |
mark(s(0)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
cons#(ok(X1),ok(X2)) |
→ |
cons#(X1,X2) |
(67) |
could be deleted.
1.1.6.1 Dependency Graph Processor
The dependency pairs are split into 1
component.
-
The
7th
component contains the
pair
f#(mark(X)) |
→ |
f#(X) |
(75) |
f#(ok(X)) |
→ |
f#(X) |
(45) |
1.1.7 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
[cons#(x1, x2)] |
=
|
0 |
[s(x1)] |
=
|
x1 + 1 |
[top(x1)] |
=
|
0 |
[top#(x1)] |
=
|
0 |
[f(x1)] |
=
|
x1 + 1 |
[proper(x1)] |
=
|
x1 + 1 |
[ok(x1)] |
=
|
x1 + 1 |
[0] |
=
|
1 |
[sel#(x1, x2)] |
=
|
0 |
[sel(x1, x2)] |
=
|
x1 + x2 + 3 |
[s#(x1)] |
=
|
0 |
[mark(x1)] |
=
|
x1 + 436 |
[f#(x1)] |
=
|
x1 + 0 |
[g#(x1)] |
=
|
0 |
[proper#(x1)] |
=
|
0 |
[active(x1)] |
=
|
439 |
[cons(x1, x2)] |
=
|
x1 + x2 + 1 |
[active#(x1)] |
=
|
0 |
[g(x1)] |
=
|
x1 + 1 |
together with the usable
rules
s(mark(X)) |
→ |
mark(s(X)) |
(15) |
sel(mark(X1),X2) |
→ |
mark(sel(X1,X2)) |
(16) |
proper(0) |
→ |
ok(0) |
(21) |
g(ok(X)) |
→ |
ok(g(X)) |
(26) |
sel(X1,mark(X2)) |
→ |
mark(sel(X1,X2)) |
(17) |
s(ok(X)) |
→ |
ok(s(X)) |
(27) |
sel(ok(X1),ok(X2)) |
→ |
ok(sel(X1,X2)) |
(28) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(25) |
g(mark(X)) |
→ |
mark(g(X)) |
(14) |
f(mark(X)) |
→ |
mark(f(X)) |
(12) |
f(ok(X)) |
→ |
ok(f(X)) |
(24) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(13) |
active(g(0)) |
→ |
mark(s(0)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
f#(mark(X)) |
→ |
f#(X) |
(75) |
f#(ok(X)) |
→ |
f#(X) |
(45) |
could be deleted.
1.1.7.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
8th
component contains the
pair
g#(mark(X)) |
→ |
g#(X) |
(71) |
g#(ok(X)) |
→ |
g#(X) |
(34) |
1.1.8 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
[cons#(x1, x2)] |
=
|
0 |
[s(x1)] |
=
|
x1 + 1 |
[top(x1)] |
=
|
0 |
[top#(x1)] |
=
|
0 |
[f(x1)] |
=
|
x1 + 42170 |
[proper(x1)] |
=
|
x1 + 1 |
[ok(x1)] |
=
|
x1 + 1 |
[0] |
=
|
1 |
[sel#(x1, x2)] |
=
|
0 |
[sel(x1, x2)] |
=
|
x1 + x2 + 1 |
[s#(x1)] |
=
|
0 |
[mark(x1)] |
=
|
x1 + 1 |
[f#(x1)] |
=
|
0 |
[g#(x1)] |
=
|
x1 + 0 |
[proper#(x1)] |
=
|
0 |
[active(x1)] |
=
|
43149 |
[cons(x1, x2)] |
=
|
x1 + x2 + 1 |
[active#(x1)] |
=
|
0 |
[g(x1)] |
=
|
x1 + 977 |
together with the usable
rules
s(mark(X)) |
→ |
mark(s(X)) |
(15) |
sel(mark(X1),X2) |
→ |
mark(sel(X1,X2)) |
(16) |
proper(0) |
→ |
ok(0) |
(21) |
g(ok(X)) |
→ |
ok(g(X)) |
(26) |
sel(X1,mark(X2)) |
→ |
mark(sel(X1,X2)) |
(17) |
s(ok(X)) |
→ |
ok(s(X)) |
(27) |
sel(ok(X1),ok(X2)) |
→ |
ok(sel(X1,X2)) |
(28) |
cons(ok(X1),ok(X2)) |
→ |
ok(cons(X1,X2)) |
(25) |
g(mark(X)) |
→ |
mark(g(X)) |
(14) |
f(mark(X)) |
→ |
mark(f(X)) |
(12) |
f(ok(X)) |
→ |
ok(f(X)) |
(24) |
cons(mark(X1),X2) |
→ |
mark(cons(X1,X2)) |
(13) |
active(g(0)) |
→ |
mark(s(0)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
g#(mark(X)) |
→ |
g#(X) |
(71) |
g#(ok(X)) |
→ |
g#(X) |
(34) |
could be deleted.
1.1.8.1 Dependency Graph Processor
The dependency pairs are split into 0
components.