The rewrite relation of the following TRS is considered.
active(2nd(cons1(X,cons(Y,Z)))) | → | mark(Y) | (1) |
active(2nd(cons(X,X1))) | → | mark(2nd(cons1(X,X1))) | (2) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (3) |
mark(2nd(X)) | → | active(2nd(mark(X))) | (4) |
mark(cons1(X1,X2)) | → | active(cons1(mark(X1),mark(X2))) | (5) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (6) |
mark(from(X)) | → | active(from(mark(X))) | (7) |
mark(s(X)) | → | active(s(mark(X))) | (8) |
2nd(mark(X)) | → | 2nd(X) | (9) |
2nd(active(X)) | → | 2nd(X) | (10) |
cons1(mark(X1),X2) | → | cons1(X1,X2) | (11) |
cons1(X1,mark(X2)) | → | cons1(X1,X2) | (12) |
cons1(active(X1),X2) | → | cons1(X1,X2) | (13) |
cons1(X1,active(X2)) | → | cons1(X1,X2) | (14) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
from(mark(X)) | → | from(X) | (19) |
from(active(X)) | → | from(X) | (20) |
s(mark(X)) | → | s(X) | (21) |
s(active(X)) | → | s(X) | (22) |
active#(2nd(cons(X,X1))) | → | 2nd#(cons1(X,X1)) | (23) |
active#(from(X)) | → | s#(X) | (24) |
mark#(2nd(X)) | → | active#(2nd(mark(X))) | (25) |
mark#(2nd(X)) | → | mark#(X) | (26) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (27) |
mark#(cons(X1,X2)) | → | mark#(X1) | (28) |
mark#(from(X)) | → | active#(from(mark(X))) | (29) |
cons1#(mark(X1),X2) | → | cons1#(X1,X2) | (30) |
cons1#(X1,active(X2)) | → | cons1#(X1,X2) | (31) |
s#(mark(X)) | → | s#(X) | (32) |
from#(mark(X)) | → | from#(X) | (33) |
from#(active(X)) | → | from#(X) | (34) |
mark#(s(X)) | → | active#(s(mark(X))) | (35) |
mark#(from(X)) | → | from#(mark(X)) | (36) |
active#(2nd(cons1(X,cons(Y,Z)))) | → | mark#(Y) | (37) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (38) |
mark#(cons1(X1,X2)) | → | mark#(X2) | (39) |
cons1#(active(X1),X2) | → | cons1#(X1,X2) | (40) |
cons1#(X1,mark(X2)) | → | cons1#(X1,X2) | (41) |
mark#(s(X)) | → | mark#(X) | (42) |
mark#(cons(X1,X2)) | → | cons#(mark(X1),X2) | (43) |
active#(from(X)) | → | from#(s(X)) | (44) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (45) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (46) |
active#(from(X)) | → | cons#(X,from(s(X))) | (47) |
mark#(cons1(X1,X2)) | → | active#(cons1(mark(X1),mark(X2))) | (48) |
mark#(s(X)) | → | s#(mark(X)) | (49) |
mark#(cons1(X1,X2)) | → | mark#(X1) | (50) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (51) |
mark#(2nd(X)) | → | 2nd#(mark(X)) | (52) |
s#(active(X)) | → | s#(X) | (53) |
2nd#(active(X)) | → | 2nd#(X) | (54) |
active#(2nd(cons(X,X1))) | → | cons1#(X,X1) | (55) |
active#(2nd(cons(X,X1))) | → | mark#(2nd(cons1(X,X1))) | (56) |
2nd#(mark(X)) | → | 2nd#(X) | (57) |
mark#(from(X)) | → | mark#(X) | (58) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (59) |
mark#(cons1(X1,X2)) | → | cons1#(mark(X1),mark(X2)) | (60) |
The dependency pairs are split into 6 components.
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (59) |
active#(2nd(cons1(X,cons(Y,Z)))) | → | mark#(Y) | (37) |
mark#(from(X)) | → | mark#(X) | (58) |
mark#(s(X)) | → | active#(s(mark(X))) | (35) |
active#(2nd(cons(X,X1))) | → | mark#(2nd(cons1(X,X1))) | (56) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (51) |
mark#(from(X)) | → | active#(from(mark(X))) | (29) |
mark#(cons1(X1,X2)) | → | mark#(X1) | (50) |
mark#(cons1(X1,X2)) | → | active#(cons1(mark(X1),mark(X2))) | (48) |
mark#(cons(X1,X2)) | → | mark#(X1) | (28) |
mark#(2nd(X)) | → | mark#(X) | (26) |
mark#(s(X)) | → | mark#(X) | (42) |
mark#(2nd(X)) | → | active#(2nd(mark(X))) | (25) |
mark#(cons1(X1,X2)) | → | mark#(X2) | (39) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 1 |
[cons1#(x1, x2)] | = | 0 |
[2nd(x1)] | = | 71264 |
[cons1(x1, x2)] | = | 62898 |
[mark#(x1)] | = | 71264 |
[from(x1)] | = | 71264 |
[s#(x1)] | = | 0 |
[2nd#(x1)] | = | 0 |
[mark(x1)] | = | 1 |
[from#(x1)] | = | 0 |
[active(x1)] | = | 1 |
[cons(x1, x2)] | = | 5854 |
[active#(x1)] | = | x1 + 0 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
mark(2nd(X)) | → | active(2nd(mark(X))) | (4) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
mark(s(X)) | → | active(s(mark(X))) | (8) |
active(2nd(cons1(X,cons(Y,Z)))) | → | mark(Y) | (1) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (3) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
s(mark(X)) | → | s(X) | (21) |
from(mark(X)) | → | from(X) | (19) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
s(active(X)) | → | s(X) | (22) |
mark(cons1(X1,X2)) | → | active(cons1(mark(X1),mark(X2))) | (5) |
2nd(active(X)) | → | 2nd(X) | (10) |
mark(from(X)) | → | active(from(mark(X))) | (7) |
from(active(X)) | → | from(X) | (20) |
cons1(X1,active(X2)) | → | cons1(X1,X2) | (14) |
cons1(X1,mark(X2)) | → | cons1(X1,X2) | (12) |
cons1(mark(X1),X2) | → | cons1(X1,X2) | (11) |
2nd(mark(X)) | → | 2nd(X) | (9) |
cons1(active(X1),X2) | → | cons1(X1,X2) | (13) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (6) |
active(2nd(cons(X,X1))) | → | mark(2nd(cons1(X,X1))) | (2) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (59) |
mark#(s(X)) | → | active#(s(mark(X))) | (35) |
mark#(cons1(X1,X2)) | → | active#(cons1(mark(X1),mark(X2))) | (48) |
The dependency pairs are split into 1 component.
mark#(2nd(X)) | → | mark#(X) | (26) |
mark#(2nd(X)) | → | active#(2nd(mark(X))) | (25) |
mark#(s(X)) | → | mark#(X) | (42) |
active#(2nd(cons1(X,cons(Y,Z)))) | → | mark#(Y) | (37) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (51) |
mark#(cons1(X1,X2)) | → | mark#(X2) | (39) |
mark#(cons1(X1,X2)) | → | mark#(X1) | (50) |
mark#(from(X)) | → | mark#(X) | (58) |
mark#(from(X)) | → | active#(from(mark(X))) | (29) |
mark#(cons(X1,X2)) | → | mark#(X1) | (28) |
active#(2nd(cons(X,X1))) | → | mark#(2nd(cons1(X,X1))) | (56) |
[cons#(x1, x2)] | = | max(0) |
[s(x1)] | = | x1 + 0 |
[cons1#(x1, x2)] | = | max(0) |
[2nd(x1)] | = | x1 + 15922 |
[cons1(x1, x2)] | = | max(x1 + 20538, x2 + 0, 0) |
[mark#(x1)] | = | x1 + 0 |
[from(x1)] | = | x1 + 20540 |
[s#(x1)] | = | 0 |
[2nd#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 0 |
[cons(x1, x2)] | = | max(x1 + 20539, x2 + 0, 0) |
[active#(x1)] | = | x1 + 0 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
mark(2nd(X)) | → | active(2nd(mark(X))) | (4) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
mark(s(X)) | → | active(s(mark(X))) | (8) |
active(2nd(cons1(X,cons(Y,Z)))) | → | mark(Y) | (1) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (3) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
s(mark(X)) | → | s(X) | (21) |
from(mark(X)) | → | from(X) | (19) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
s(active(X)) | → | s(X) | (22) |
mark(cons1(X1,X2)) | → | active(cons1(mark(X1),mark(X2))) | (5) |
2nd(active(X)) | → | 2nd(X) | (10) |
mark(from(X)) | → | active(from(mark(X))) | (7) |
from(active(X)) | → | from(X) | (20) |
cons1(X1,active(X2)) | → | cons1(X1,X2) | (14) |
cons1(X1,mark(X2)) | → | cons1(X1,X2) | (12) |
cons1(mark(X1),X2) | → | cons1(X1,X2) | (11) |
2nd(mark(X)) | → | 2nd(X) | (9) |
cons1(active(X1),X2) | → | cons1(X1,X2) | (13) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (6) |
active(2nd(cons(X,X1))) | → | mark(2nd(cons1(X,X1))) | (2) |
mark#(2nd(X)) | → | mark#(X) | (26) |
active#(2nd(cons1(X,cons(Y,Z)))) | → | mark#(Y) | (37) |
mark#(cons1(X1,X2)) | → | mark#(X1) | (50) |
mark#(from(X)) | → | mark#(X) | (58) |
mark#(cons(X1,X2)) | → | mark#(X1) | (28) |
The dependency pairs are split into 1 component.
mark#(2nd(X)) | → | active#(2nd(mark(X))) | (25) |
mark#(s(X)) | → | mark#(X) | (42) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (51) |
mark#(cons1(X1,X2)) | → | mark#(X2) | (39) |
mark#(from(X)) | → | active#(from(mark(X))) | (29) |
active#(2nd(cons(X,X1))) | → | mark#(2nd(cons1(X,X1))) | (56) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[cons1#(x1, x2)] | = | 0 |
[2nd(x1)] | = | 44365 |
[cons1(x1, x2)] | = | x1 + x2 + 62898 |
[mark#(x1)] | = | x1 + 0 |
[from(x1)] | = | 44366 |
[s#(x1)] | = | 0 |
[2nd#(x1)] | = | 0 |
[mark(x1)] | = | 1 |
[from#(x1)] | = | 0 |
[active(x1)] | = | 0 |
[cons(x1, x2)] | = | 44364 |
[active#(x1)] | = | 44365 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
2nd(active(X)) | → | 2nd(X) | (10) |
2nd(mark(X)) | → | 2nd(X) | (9) |
mark#(s(X)) | → | mark#(X) | (42) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (51) |
mark#(cons1(X1,X2)) | → | mark#(X2) | (39) |
mark#(from(X)) | → | active#(from(mark(X))) | (29) |
The dependency pairs are split into 1 component.
mark#(2nd(X)) | → | active#(2nd(mark(X))) | (25) |
active#(2nd(cons(X,X1))) | → | mark#(2nd(cons1(X,X1))) | (56) |
π(cons#) | = | 2 |
π(2nd) | = | 1 |
π(mark#) | = | 1 |
π(2nd#) | = | 1 |
π(mark) | = | 1 |
π(active) | = | 1 |
π(active#) | = | 1 |
prec(s) | = | 0 | status(s) | = | [] | list-extension(s) | = | Lex | ||
prec(cons1#) | = | 0 | status(cons1#) | = | [2, 1] | list-extension(cons1#) | = | Lex | ||
prec(cons1) | = | 1 | status(cons1) | = | [] | list-extension(cons1) | = | Lex | ||
prec(from) | = | 2 | status(from) | = | [1] | list-extension(from) | = | Lex | ||
prec(s#) | = | 0 | status(s#) | = | [] | list-extension(s#) | = | Lex | ||
prec(from#) | = | 0 | status(from#) | = | [] | list-extension(from#) | = | Lex | ||
prec(cons) | = | 1 | status(cons) | = | [1] | list-extension(cons) | = | Lex |
[s(x1)] | = | 0 |
[cons1#(x1, x2)] | = | max(x1 + 1, x2 + 1, 0) |
[cons1(x1, x2)] | = | max(x1 + 28101, x2 + 0, 0) |
[from(x1)] | = | x1 + 28102 |
[s#(x1)] | = | 1 |
[from#(x1)] | = | 1 |
[cons(x1, x2)] | = | max(x1 + 28101, x2 + 0, 0) |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
mark(2nd(X)) | → | active(2nd(mark(X))) | (4) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
mark(s(X)) | → | active(s(mark(X))) | (8) |
active(2nd(cons1(X,cons(Y,Z)))) | → | mark(Y) | (1) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (3) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
s(mark(X)) | → | s(X) | (21) |
from(mark(X)) | → | from(X) | (19) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
s(active(X)) | → | s(X) | (22) |
mark(cons1(X1,X2)) | → | active(cons1(mark(X1),mark(X2))) | (5) |
2nd(active(X)) | → | 2nd(X) | (10) |
mark(from(X)) | → | active(from(mark(X))) | (7) |
from(active(X)) | → | from(X) | (20) |
cons1(X1,active(X2)) | → | cons1(X1,X2) | (14) |
cons1(X1,mark(X2)) | → | cons1(X1,X2) | (12) |
cons1(mark(X1),X2) | → | cons1(X1,X2) | (11) |
2nd(mark(X)) | → | 2nd(X) | (9) |
cons1(active(X1),X2) | → | cons1(X1,X2) | (13) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (6) |
active(2nd(cons(X,X1))) | → | mark(2nd(cons1(X,X1))) | (2) |
active#(2nd(cons(X,X1))) | → | mark#(2nd(cons1(X,X1))) | (56) |
The dependency pairs are split into 0 components.
cons1#(X1,active(X2)) | → | cons1#(X1,X2) | (31) |
cons1#(mark(X1),X2) | → | cons1#(X1,X2) | (30) |
cons1#(X1,mark(X2)) | → | cons1#(X1,X2) | (41) |
cons1#(active(X1),X2) | → | cons1#(X1,X2) | (40) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 31598 |
[cons1#(x1, x2)] | = | x1 + 0 |
[2nd(x1)] | = | 24766 |
[cons1(x1, x2)] | = | x1 + 40436 |
[mark#(x1)] | = | 1 |
[from(x1)] | = | 0 |
[s#(x1)] | = | 0 |
[2nd#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 1 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 2 |
[cons(x1, x2)] | = | 20586 |
[active#(x1)] | = | 1 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
s(mark(X)) | → | s(X) | (21) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
s(active(X)) | → | s(X) | (22) |
cons1#(mark(X1),X2) | → | cons1#(X1,X2) | (30) |
cons1#(active(X1),X2) | → | cons1#(X1,X2) | (40) |
The dependency pairs are split into 1 component.
cons1#(X1,active(X2)) | → | cons1#(X1,X2) | (31) |
cons1#(X1,mark(X2)) | → | cons1#(X1,X2) | (41) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 31598 |
[cons1#(x1, x2)] | = | x2 + 0 |
[2nd(x1)] | = | 37045 |
[cons1(x1, x2)] | = | x1 + 1 |
[mark#(x1)] | = | 1 |
[from(x1)] | = | 0 |
[s#(x1)] | = | 0 |
[2nd#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 29405 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 29406 |
[cons(x1, x2)] | = | 2 |
[active#(x1)] | = | 1 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
s(mark(X)) | → | s(X) | (21) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
s(active(X)) | → | s(X) | (22) |
cons1#(X1,active(X2)) | → | cons1#(X1,X2) | (31) |
cons1#(X1,mark(X2)) | → | cons1#(X1,X2) | (41) |
The dependency pairs are split into 0 components.
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (38) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (27) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (46) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (45) |
[cons#(x1, x2)] | = | x1 + x2 + 0 |
[s(x1)] | = | x1 + 31598 |
[cons1#(x1, x2)] | = | 0 |
[2nd(x1)] | = | 1 |
[cons1(x1, x2)] | = | x1 + 1 |
[mark#(x1)] | = | 1 |
[from(x1)] | = | 0 |
[s#(x1)] | = | 0 |
[2nd#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 29405 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 42911 |
[cons(x1, x2)] | = | 13507 |
[active#(x1)] | = | 1 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
s(mark(X)) | → | s(X) | (21) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
s(active(X)) | → | s(X) | (22) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (38) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (27) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (46) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (45) |
The dependency pairs are split into 0 components.
from#(active(X)) | → | from#(X) | (34) |
from#(mark(X)) | → | from#(X) | (33) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[cons1#(x1, x2)] | = | 0 |
[2nd(x1)] | = | 9508 |
[cons1(x1, x2)] | = | x1 + 1 |
[mark#(x1)] | = | 1 |
[from(x1)] | = | 0 |
[s#(x1)] | = | 0 |
[2nd#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 29405 |
[from#(x1)] | = | x1 + 0 |
[active(x1)] | = | x1 + 48670 |
[cons(x1, x2)] | = | 19266 |
[active#(x1)] | = | 1 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
s(mark(X)) | → | s(X) | (21) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
s(active(X)) | → | s(X) | (22) |
from#(active(X)) | → | from#(X) | (34) |
from#(mark(X)) | → | from#(X) | (33) |
The dependency pairs are split into 0 components.
s#(mark(X)) | → | s#(X) | (32) |
s#(active(X)) | → | s#(X) | (53) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[cons1#(x1, x2)] | = | 0 |
[2nd(x1)] | = | 30371 |
[cons1(x1, x2)] | = | x1 + 1 |
[mark#(x1)] | = | 1 |
[from(x1)] | = | 0 |
[s#(x1)] | = | x1 + 0 |
[2nd#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 29405 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 29406 |
[cons(x1, x2)] | = | 2 |
[active#(x1)] | = | 1 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
s(mark(X)) | → | s(X) | (21) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
s(active(X)) | → | s(X) | (22) |
s#(mark(X)) | → | s#(X) | (32) |
s#(active(X)) | → | s#(X) | (53) |
The dependency pairs are split into 0 components.
2nd#(mark(X)) | → | 2nd#(X) | (57) |
2nd#(active(X)) | → | 2nd#(X) | (54) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[cons1#(x1, x2)] | = | 0 |
[2nd(x1)] | = | 1 |
[cons1(x1, x2)] | = | x1 + 21387 |
[mark#(x1)] | = | 1 |
[from(x1)] | = | 0 |
[s#(x1)] | = | 0 |
[2nd#(x1)] | = | x1 + 0 |
[mark(x1)] | = | x1 + 29405 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 29406 |
[cons(x1, x2)] | = | 2 |
[active#(x1)] | = | 1 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
s(mark(X)) | → | s(X) | (21) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
s(active(X)) | → | s(X) | (22) |
2nd#(mark(X)) | → | 2nd#(X) | (57) |
2nd#(active(X)) | → | 2nd#(X) | (54) |
The dependency pairs are split into 0 components.