The rewrite relation of the following TRS is considered.
active(from(X)) | → | mark(cons(X,from(s(X)))) | (1) |
active(first(0,Z)) | → | mark(nil) | (2) |
active(first(s(X),cons(Y,Z))) | → | mark(cons(Y,first(X,Z))) | (3) |
active(sel(0,cons(X,Z))) | → | mark(X) | (4) |
active(sel(s(X),cons(Y,Z))) | → | mark(sel(X,Z)) | (5) |
mark(from(X)) | → | active(from(mark(X))) | (6) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (7) |
mark(s(X)) | → | active(s(mark(X))) | (8) |
mark(first(X1,X2)) | → | active(first(mark(X1),mark(X2))) | (9) |
mark(0) | → | active(0) | (10) |
mark(nil) | → | active(nil) | (11) |
mark(sel(X1,X2)) | → | active(sel(mark(X1),mark(X2))) | (12) |
from(mark(X)) | → | from(X) | (13) |
from(active(X)) | → | from(X) | (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) |
s(mark(X)) | → | s(X) | (19) |
s(active(X)) | → | s(X) | (20) |
first(mark(X1),X2) | → | first(X1,X2) | (21) |
first(X1,mark(X2)) | → | first(X1,X2) | (22) |
first(active(X1),X2) | → | first(X1,X2) | (23) |
first(X1,active(X2)) | → | first(X1,X2) | (24) |
sel(mark(X1),X2) | → | sel(X1,X2) | (25) |
sel(X1,mark(X2)) | → | sel(X1,X2) | (26) |
sel(active(X1),X2) | → | sel(X1,X2) | (27) |
sel(X1,active(X2)) | → | sel(X1,X2) | (28) |
mark#(from(X)) | → | active#(from(mark(X))) | (29) |
mark#(s(X)) | → | mark#(X) | (30) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (31) |
active#(first(s(X),cons(Y,Z))) | → | cons#(Y,first(X,Z)) | (32) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (33) |
mark#(s(X)) | → | s#(mark(X)) | (34) |
mark#(s(X)) | → | active#(s(mark(X))) | (35) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (36) |
active#(from(X)) | → | cons#(X,from(s(X))) | (37) |
mark#(first(X1,X2)) | → | active#(first(mark(X1),mark(X2))) | (38) |
active#(from(X)) | → | s#(X) | (39) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (40) |
mark#(first(X1,X2)) | → | mark#(X2) | (41) |
first#(X1,active(X2)) | → | first#(X1,X2) | (42) |
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (43) |
mark#(0) | → | active#(0) | (44) |
active#(sel(0,cons(X,Z))) | → | mark#(X) | (45) |
first#(active(X1),X2) | → | first#(X1,X2) | (46) |
sel#(X1,mark(X2)) | → | sel#(X1,X2) | (47) |
mark#(sel(X1,X2)) | → | sel#(mark(X1),mark(X2)) | (48) |
s#(mark(X)) | → | s#(X) | (49) |
active#(sel(s(X),cons(Y,Z))) | → | sel#(X,Z) | (50) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (51) |
mark#(first(X1,X2)) | → | first#(mark(X1),mark(X2)) | (52) |
active#(from(X)) | → | from#(s(X)) | (53) |
mark#(nil) | → | active#(nil) | (54) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (55) |
from#(mark(X)) | → | from#(X) | (56) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (57) |
sel#(active(X1),X2) | → | sel#(X1,X2) | (58) |
mark#(cons(X1,X2)) | → | mark#(X1) | (59) |
active#(first(s(X),cons(Y,Z))) | → | mark#(cons(Y,first(X,Z))) | (60) |
first#(X1,mark(X2)) | → | first#(X1,X2) | (61) |
from#(active(X)) | → | from#(X) | (62) |
first#(mark(X1),X2) | → | first#(X1,X2) | (63) |
s#(active(X)) | → | s#(X) | (64) |
sel#(X1,active(X2)) | → | sel#(X1,X2) | (65) |
active#(first(s(X),cons(Y,Z))) | → | first#(X,Z) | (66) |
mark#(cons(X1,X2)) | → | cons#(mark(X1),X2) | (67) |
mark#(sel(X1,X2)) | → | mark#(X2) | (68) |
mark#(from(X)) | → | from#(mark(X)) | (69) |
active#(first(0,Z)) | → | mark#(nil) | (70) |
mark#(first(X1,X2)) | → | mark#(X1) | (71) |
mark#(sel(X1,X2)) | → | mark#(X1) | (72) |
mark#(from(X)) | → | mark#(X) | (73) |
sel#(mark(X1),X2) | → | sel#(X1,X2) | (74) |
The dependency pairs are split into 6 components.
mark#(from(X)) | → | mark#(X) | (73) |
mark#(sel(X1,X2)) | → | mark#(X1) | (72) |
mark#(first(X1,X2)) | → | mark#(X1) | (71) |
active#(sel(0,cons(X,Z))) | → | mark#(X) | (45) |
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (43) |
mark#(sel(X1,X2)) | → | mark#(X2) | (68) |
mark#(first(X1,X2)) | → | mark#(X2) | (41) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (40) |
mark#(first(X1,X2)) | → | active#(first(mark(X1),mark(X2))) | (38) |
active#(first(s(X),cons(Y,Z))) | → | mark#(cons(Y,first(X,Z))) | (60) |
mark#(cons(X1,X2)) | → | mark#(X1) | (59) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (36) |
mark#(s(X)) | → | active#(s(mark(X))) | (35) |
mark#(s(X)) | → | mark#(X) | (30) |
mark#(from(X)) | → | active#(from(mark(X))) | (29) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (51) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 1 |
[mark#(x1)] | = | 1144 |
[0] | = | 1146 |
[sel#(x1, x2)] | = | 0 |
[from(x1)] | = | 1144 |
[sel(x1, x2)] | = | 1144 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 29246 |
[mark(x1)] | = | 1145 |
[first(x1, x2)] | = | 1144 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 0 |
[cons(x1, x2)] | = | 1143 |
[active#(x1)] | = | x1 + 0 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
first(mark(X1),X2) | → | first(X1,X2) | (21) |
sel(X1,mark(X2)) | → | sel(X1,X2) | (26) |
s(mark(X)) | → | s(X) | (19) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
sel(active(X1),X2) | → | sel(X1,X2) | (27) |
first(X1,mark(X2)) | → | first(X1,X2) | (22) |
sel(X1,active(X2)) | → | sel(X1,X2) | (28) |
s(active(X)) | → | s(X) | (20) |
sel(mark(X1),X2) | → | sel(X1,X2) | (25) |
from(active(X)) | → | from(X) | (14) |
first(active(X1),X2) | → | first(X1,X2) | (23) |
first(X1,active(X2)) | → | first(X1,X2) | (24) |
from(mark(X)) | → | from(X) | (13) |
mark#(s(X)) | → | active#(s(mark(X))) | (35) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (51) |
The dependency pairs are split into 1 component.
active#(sel(0,cons(X,Z))) | → | mark#(X) | (45) |
mark#(s(X)) | → | mark#(X) | (30) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (36) |
active#(first(s(X),cons(Y,Z))) | → | mark#(cons(Y,first(X,Z))) | (60) |
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (43) |
mark#(cons(X1,X2)) | → | mark#(X1) | (59) |
mark#(sel(X1,X2)) | → | mark#(X2) | (68) |
mark#(sel(X1,X2)) | → | mark#(X1) | (72) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (40) |
mark#(first(X1,X2)) | → | mark#(X2) | (41) |
mark#(first(X1,X2)) | → | mark#(X1) | (71) |
mark#(first(X1,X2)) | → | active#(first(mark(X1),mark(X2))) | (38) |
mark#(from(X)) | → | mark#(X) | (73) |
mark#(from(X)) | → | active#(from(mark(X))) | (29) |
[cons#(x1, x2)] | = | max(0) |
[s(x1)] | = | x1 + 0 |
[mark#(x1)] | = | x1 + 0 |
[0] | = | 2 |
[sel#(x1, x2)] | = | max(0) |
[from(x1)] | = | x1 + 21242 |
[sel(x1, x2)] | = | max(x1 + 23680, x2 + 2438, 0) |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | max(0) |
[nil] | = | 21241 |
[mark(x1)] | = | x1 + 0 |
[first(x1, x2)] | = | max(x1 + 21239, x2 + 21240, 0) |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 0 |
[cons(x1, x2)] | = | max(x1 + 21241, x2 + 0, 0) |
[active#(x1)] | = | x1 + 0 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
active(sel(0,cons(X,Z))) | → | mark(X) | (4) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
mark(s(X)) | → | active(s(mark(X))) | (8) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (1) |
active(first(s(X),cons(Y,Z))) | → | mark(cons(Y,first(X,Z))) | (3) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
first(mark(X1),X2) | → | first(X1,X2) | (21) |
sel(X1,mark(X2)) | → | sel(X1,X2) | (26) |
s(mark(X)) | → | s(X) | (19) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
sel(active(X1),X2) | → | sel(X1,X2) | (27) |
first(X1,mark(X2)) | → | first(X1,X2) | (22) |
sel(X1,active(X2)) | → | sel(X1,X2) | (28) |
active(sel(s(X),cons(Y,Z))) | → | mark(sel(X,Z)) | (5) |
mark(0) | → | active(0) | (10) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (7) |
s(active(X)) | → | s(X) | (20) |
sel(mark(X1),X2) | → | sel(X1,X2) | (25) |
from(active(X)) | → | from(X) | (14) |
mark(sel(X1,X2)) | → | active(sel(mark(X1),mark(X2))) | (12) |
first(active(X1),X2) | → | first(X1,X2) | (23) |
first(X1,active(X2)) | → | first(X1,X2) | (24) |
mark(nil) | → | active(nil) | (11) |
mark(first(X1,X2)) | → | active(first(mark(X1),mark(X2))) | (9) |
from(mark(X)) | → | from(X) | (13) |
mark(from(X)) | → | active(from(mark(X))) | (6) |
active(first(0,Z)) | → | mark(nil) | (2) |
active#(sel(0,cons(X,Z))) | → | mark#(X) | (45) |
mark#(cons(X1,X2)) | → | mark#(X1) | (59) |
mark#(sel(X1,X2)) | → | mark#(X2) | (68) |
mark#(sel(X1,X2)) | → | mark#(X1) | (72) |
mark#(first(X1,X2)) | → | mark#(X2) | (41) |
mark#(first(X1,X2)) | → | mark#(X1) | (71) |
mark#(from(X)) | → | mark#(X) | (73) |
The dependency pairs are split into 1 component.
mark#(s(X)) | → | mark#(X) | (30) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (36) |
active#(first(s(X),cons(Y,Z))) | → | mark#(cons(Y,first(X,Z))) | (60) |
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (43) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (40) |
mark#(first(X1,X2)) | → | active#(first(mark(X1),mark(X2))) | (38) |
mark#(from(X)) | → | active#(from(mark(X))) | (29) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[mark#(x1)] | = | x1 + 0 |
[0] | = | 0 |
[sel#(x1, x2)] | = | 0 |
[from(x1)] | = | 21240 |
[sel(x1, x2)] | = | 21239 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 1 |
[mark(x1)] | = | 18588 |
[first(x1, x2)] | = | x1 + 38147 |
[from#(x1)] | = | 0 |
[active(x1)] | = | 18587 |
[cons(x1, x2)] | = | 21238 |
[active#(x1)] | = | 21239 |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
sel(X1,mark(X2)) | → | sel(X1,X2) | (26) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
sel(active(X1),X2) | → | sel(X1,X2) | (27) |
sel(X1,active(X2)) | → | sel(X1,X2) | (28) |
sel(mark(X1),X2) | → | sel(X1,X2) | (25) |
mark#(s(X)) | → | mark#(X) | (30) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (36) |
active#(first(s(X),cons(Y,Z))) | → | mark#(cons(Y,first(X,Z))) | (60) |
mark#(first(X1,X2)) | → | active#(first(mark(X1),mark(X2))) | (38) |
mark#(from(X)) | → | active#(from(mark(X))) | (29) |
The dependency pairs are split into 1 component.
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (43) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (40) |
π(mark) | = | 1 |
π(active) | = | 1 |
π(active#) | = | 1 |
prec(cons#) | = | 0 | status(cons#) | = | [] | list-extension(cons#) | = | Lex | ||
prec(s) | = | 2 | status(s) | = | [1] | list-extension(s) | = | Lex | ||
prec(mark#) | = | 3 | status(mark#) | = | [1] | list-extension(mark#) | = | Lex | ||
prec(0) | = | 1 | status(0) | = | [] | list-extension(0) | = | Lex | ||
prec(sel#) | = | 0 | status(sel#) | = | [2, 1] | list-extension(sel#) | = | Lex | ||
prec(from) | = | 6 | status(from) | = | [1] | list-extension(from) | = | Lex | ||
prec(sel) | = | 5 | status(sel) | = | [1, 2] | list-extension(sel) | = | Lex | ||
prec(s#) | = | 0 | status(s#) | = | [] | list-extension(s#) | = | Lex | ||
prec(first#) | = | 0 | status(first#) | = | [] | list-extension(first#) | = | Lex | ||
prec(nil) | = | 1 | status(nil) | = | [] | list-extension(nil) | = | Lex | ||
prec(first) | = | 1 | status(first) | = | [] | list-extension(first) | = | Lex | ||
prec(from#) | = | 0 | status(from#) | = | [] | list-extension(from#) | = | Lex | ||
prec(cons) | = | 1 | status(cons) | = | [] | list-extension(cons) | = | Lex |
[cons#(x1, x2)] | = | max(x1 + 1, 0) |
[s(x1)] | = | x1 + 0 |
[mark#(x1)] | = | x1 + 0 |
[0] | = | 30613 |
[sel#(x1, x2)] | = | x1 + x2 + 1 |
[from(x1)] | = | x1 + 32286 |
[sel(x1, x2)] | = | x1 + x2 + 10451 |
[s#(x1)] | = | 1 |
[first#(x1, x2)] | = | x2 + 1 |
[nil] | = | 30613 |
[first(x1, x2)] | = | x1 + x2 + 0 |
[from#(x1)] | = | 1 |
[cons(x1, x2)] | = | max(x1 + 0, x2 + 0, 0) |
cons(X1,active(X2)) | → | cons(X1,X2) | (18) |
active(sel(0,cons(X,Z))) | → | mark(X) | (4) |
cons(mark(X1),X2) | → | cons(X1,X2) | (15) |
mark(s(X)) | → | active(s(mark(X))) | (8) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (1) |
active(first(s(X),cons(Y,Z))) | → | mark(cons(Y,first(X,Z))) | (3) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (16) |
first(mark(X1),X2) | → | first(X1,X2) | (21) |
sel(X1,mark(X2)) | → | sel(X1,X2) | (26) |
s(mark(X)) | → | s(X) | (19) |
cons(active(X1),X2) | → | cons(X1,X2) | (17) |
sel(active(X1),X2) | → | sel(X1,X2) | (27) |
first(X1,mark(X2)) | → | first(X1,X2) | (22) |
sel(X1,active(X2)) | → | sel(X1,X2) | (28) |
active(sel(s(X),cons(Y,Z))) | → | mark(sel(X,Z)) | (5) |
mark(0) | → | active(0) | (10) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (7) |
s(active(X)) | → | s(X) | (20) |
sel(mark(X1),X2) | → | sel(X1,X2) | (25) |
from(active(X)) | → | from(X) | (14) |
mark(sel(X1,X2)) | → | active(sel(mark(X1),mark(X2))) | (12) |
first(active(X1),X2) | → | first(X1,X2) | (23) |
first(X1,active(X2)) | → | first(X1,X2) | (24) |
mark(nil) | → | active(nil) | (11) |
mark(first(X1,X2)) | → | active(first(mark(X1),mark(X2))) | (9) |
from(mark(X)) | → | from(X) | (13) |
mark(from(X)) | → | active(from(mark(X))) | (6) |
active(first(0,Z)) | → | mark(nil) | (2) |
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (43) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (40) |
The dependency pairs are split into 0 components.
first#(active(X1),X2) | → | first#(X1,X2) | (46) |
first#(X1,active(X2)) | → | first#(X1,X2) | (42) |
first#(mark(X1),X2) | → | first#(X1,X2) | (63) |
first#(X1,mark(X2)) | → | first#(X1,X2) | (61) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 1 |
[mark#(x1)] | = | 21239 |
[0] | = | 2332 |
[sel#(x1, x2)] | = | 0 |
[from(x1)] | = | 21241 |
[sel(x1, x2)] | = | 1 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | x1 + 0 |
[nil] | = | 41379 |
[mark(x1)] | = | x1 + 3 |
[first(x1, x2)] | = | x2 + 1 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 21240 |
[active#(x1)] | = | 21239 |
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) |
first#(active(X1),X2) | → | first#(X1,X2) | (46) |
first#(mark(X1),X2) | → | first#(X1,X2) | (63) |
The dependency pairs are split into 1 component.
first#(X1,mark(X2)) | → | first#(X1,X2) | (61) |
first#(X1,active(X2)) | → | first#(X1,X2) | (42) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 13214 |
[mark#(x1)] | = | 21239 |
[0] | = | 23665 |
[sel#(x1, x2)] | = | 0 |
[from(x1)] | = | 27376 |
[sel(x1, x2)] | = | 5506 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | x2 + 0 |
[nil] | = | 43799 |
[mark(x1)] | = | x1 + 8348 |
[first(x1, x2)] | = | x2 + 8346 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 29456 |
[active#(x1)] | = | 21239 |
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) |
first#(X1,mark(X2)) | → | first#(X1,X2) | (61) |
first#(X1,active(X2)) | → | first#(X1,X2) | (42) |
The dependency pairs are split into 0 components.
sel#(mark(X1),X2) | → | sel#(X1,X2) | (74) |
sel#(X1,mark(X2)) | → | sel#(X1,X2) | (47) |
sel#(X1,active(X2)) | → | sel#(X1,X2) | (65) |
sel#(active(X1),X2) | → | sel#(X1,X2) | (58) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 1 |
[mark#(x1)] | = | 21239 |
[0] | = | 1 |
[sel#(x1, x2)] | = | x1 + x2 + 0 |
[from(x1)] | = | 1 |
[sel(x1, x2)] | = | 5450 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 43799 |
[mark(x1)] | = | x1 + 34497 |
[first(x1, x2)] | = | x2 + 34495 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 32968 |
[active#(x1)] | = | 21239 |
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) |
sel#(mark(X1),X2) | → | sel#(X1,X2) | (74) |
sel#(X1,mark(X2)) | → | sel#(X1,X2) | (47) |
sel#(X1,active(X2)) | → | sel#(X1,X2) | (65) |
sel#(active(X1),X2) | → | sel#(X1,X2) | (58) |
The dependency pairs are split into 0 components.
cons#(mark(X1),X2) | → | cons#(X1,X2) | (57) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (55) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (33) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (31) |
[cons#(x1, x2)] | = | x1 + 0 |
[s(x1)] | = | 25728 |
[mark#(x1)] | = | 21239 |
[0] | = | 1 |
[sel#(x1, x2)] | = | 0 |
[from(x1)] | = | 2 |
[sel(x1, x2)] | = | 1 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 47960 |
[mark(x1)] | = | x1 + 14925 |
[first(x1, x2)] | = | x2 + 1 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 28320 |
[active#(x1)] | = | 21239 |
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) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (57) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (31) |
The dependency pairs are split into 1 component.
cons#(X1,active(X2)) | → | cons#(X1,X2) | (33) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (55) |
[cons#(x1, x2)] | = | x2 + 0 |
[s(x1)] | = | 16335 |
[mark#(x1)] | = | 21239 |
[0] | = | 31160 |
[sel#(x1, x2)] | = | 0 |
[from(x1)] | = | 25532 |
[sel(x1, x2)] | = | 17525 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 22325 |
[mark(x1)] | = | x1 + 41099 |
[first(x1, x2)] | = | x2 + 41097 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 28320 |
[active#(x1)] | = | 21239 |
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) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (33) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (55) |
The dependency pairs are split into 0 components.
from#(active(X)) | → | from#(X) | (62) |
from#(mark(X)) | → | from#(X) | (56) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 436 |
[mark#(x1)] | = | 21239 |
[0] | = | 31160 |
[sel#(x1, x2)] | = | 0 |
[from(x1)] | = | 1 |
[sel(x1, x2)] | = | 11668 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 55691 |
[mark(x1)] | = | x1 + 58951 |
[first(x1, x2)] | = | x2 + 58949 |
[from#(x1)] | = | x1 + 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 1 |
[active#(x1)] | = | 21239 |
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) |
from#(active(X)) | → | from#(X) | (62) |
from#(mark(X)) | → | from#(X) | (56) |
The dependency pairs are split into 0 components.
s#(mark(X)) | → | s#(X) | (49) |
s#(active(X)) | → | s#(X) | (64) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 14022 |
[mark#(x1)] | = | 21239 |
[0] | = | 51902 |
[sel#(x1, x2)] | = | 0 |
[from(x1)] | = | 1 |
[sel(x1, x2)] | = | 1 |
[s#(x1)] | = | x1 + 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 38541 |
[mark(x1)] | = | x1 + 3 |
[first(x1, x2)] | = | x2 + 1 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 13825 |
[active#(x1)] | = | 21239 |
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) |
s#(mark(X)) | → | s#(X) | (49) |
s#(active(X)) | → | s#(X) | (64) |
The dependency pairs are split into 0 components.