The rewrite relation of the following TRS is considered.
active(eq(0,0)) | → | mark(true) | (1) |
active(eq(s(X),s(Y))) | → | mark(eq(X,Y)) | (2) |
active(eq(X,Y)) | → | mark(false) | (3) |
active(inf(X)) | → | mark(cons(X,inf(s(X)))) | (4) |
active(take(0,X)) | → | mark(nil) | (5) |
active(take(s(X),cons(Y,L))) | → | mark(cons(Y,take(X,L))) | (6) |
active(length(nil)) | → | mark(0) | (7) |
active(length(cons(X,L))) | → | mark(s(length(L))) | (8) |
mark(eq(X1,X2)) | → | active(eq(X1,X2)) | (9) |
mark(0) | → | active(0) | (10) |
mark(true) | → | active(true) | (11) |
mark(s(X)) | → | active(s(X)) | (12) |
mark(false) | → | active(false) | (13) |
mark(inf(X)) | → | active(inf(mark(X))) | (14) |
mark(cons(X1,X2)) | → | active(cons(X1,X2)) | (15) |
mark(take(X1,X2)) | → | active(take(mark(X1),mark(X2))) | (16) |
mark(nil) | → | active(nil) | (17) |
mark(length(X)) | → | active(length(mark(X))) | (18) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
inf(mark(X)) | → | inf(X) | (25) |
inf(active(X)) | → | inf(X) | (26) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
length(mark(X)) | → | length(X) | (35) |
length(active(X)) | → | length(X) | (36) |
active#(eq(s(X),s(Y))) | → | eq#(X,Y) | (37) |
active#(length(cons(X,L))) | → | length#(L) | (38) |
mark#(nil) | → | active#(nil) | (39) |
mark#(take(X1,X2)) | → | active#(take(mark(X1),mark(X2))) | (40) |
active#(inf(X)) | → | cons#(X,inf(s(X))) | (41) |
active#(length(cons(X,L))) | → | s#(length(L)) | (42) |
active#(length(cons(X,L))) | → | mark#(s(length(L))) | (43) |
mark#(take(X1,X2)) | → | mark#(X1) | (44) |
active#(inf(X)) | → | inf#(s(X)) | (45) |
active#(inf(X)) | → | s#(X) | (46) |
mark#(take(X1,X2)) | → | mark#(X2) | (47) |
active#(take(s(X),cons(Y,L))) | → | cons#(Y,take(X,L)) | (48) |
active#(eq(0,0)) | → | mark#(true) | (49) |
mark#(length(X)) | → | mark#(X) | (50) |
mark#(s(X)) | → | active#(s(X)) | (51) |
mark#(eq(X1,X2)) | → | active#(eq(X1,X2)) | (52) |
s#(active(X)) | → | s#(X) | (53) |
active#(take(0,X)) | → | mark#(nil) | (54) |
take#(active(X1),X2) | → | take#(X1,X2) | (55) |
active#(inf(X)) | → | mark#(cons(X,inf(s(X)))) | (56) |
s#(mark(X)) | → | s#(X) | (57) |
eq#(mark(X1),X2) | → | eq#(X1,X2) | (58) |
take#(mark(X1),X2) | → | take#(X1,X2) | (59) |
take#(X1,mark(X2)) | → | take#(X1,X2) | (60) |
mark#(length(X)) | → | active#(length(mark(X))) | (61) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (62) |
eq#(X1,mark(X2)) | → | eq#(X1,X2) | (63) |
active#(take(s(X),cons(Y,L))) | → | take#(X,L) | (64) |
active#(eq(X,Y)) | → | mark#(false) | (65) |
mark#(true) | → | active#(true) | (66) |
length#(active(X)) | → | length#(X) | (67) |
active#(take(s(X),cons(Y,L))) | → | mark#(cons(Y,take(X,L))) | (68) |
mark#(cons(X1,X2)) | → | active#(cons(X1,X2)) | (69) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (70) |
mark#(0) | → | active#(0) | (71) |
eq#(active(X1),X2) | → | eq#(X1,X2) | (72) |
take#(X1,active(X2)) | → | take#(X1,X2) | (73) |
mark#(inf(X)) | → | mark#(X) | (74) |
inf#(active(X)) | → | inf#(X) | (75) |
inf#(mark(X)) | → | inf#(X) | (76) |
eq#(X1,active(X2)) | → | eq#(X1,X2) | (77) |
mark#(take(X1,X2)) | → | take#(mark(X1),mark(X2)) | (78) |
active#(length(nil)) | → | mark#(0) | (79) |
mark#(inf(X)) | → | inf#(mark(X)) | (80) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (81) |
active#(eq(s(X),s(Y))) | → | mark#(eq(X,Y)) | (82) |
mark#(false) | → | active#(false) | (83) |
mark#(inf(X)) | → | active#(inf(mark(X))) | (84) |
length#(mark(X)) | → | length#(X) | (85) |
mark#(length(X)) | → | length#(mark(X)) | (86) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (87) |
The dependency pairs are split into 7 components.
mark#(length(X)) | → | active#(length(mark(X))) | (61) |
mark#(inf(X)) | → | active#(inf(mark(X))) | (84) |
active#(inf(X)) | → | mark#(cons(X,inf(s(X)))) | (56) |
active#(eq(s(X),s(Y))) | → | mark#(eq(X,Y)) | (82) |
mark#(eq(X1,X2)) | → | active#(eq(X1,X2)) | (52) |
mark#(s(X)) | → | active#(s(X)) | (51) |
mark#(length(X)) | → | mark#(X) | (50) |
mark#(inf(X)) | → | mark#(X) | (74) |
mark#(take(X1,X2)) | → | mark#(X2) | (47) |
mark#(cons(X1,X2)) | → | active#(cons(X1,X2)) | (69) |
active#(take(s(X),cons(Y,L))) | → | mark#(cons(Y,take(X,L))) | (68) |
mark#(take(X1,X2)) | → | mark#(X1) | (44) |
active#(length(cons(X,L))) | → | mark#(s(length(L))) | (43) |
mark#(take(X1,X2)) | → | active#(take(mark(X1),mark(X2))) | (40) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 18588 |
[take#(x1, x2)] | = | 0 |
[take(x1, x2)] | = | x1 + x2 + 15521 |
[eq(x1, x2)] | = | 23423 |
[false] | = | 11302 |
[true] | = | 9726 |
[eq#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 0 |
[0] | = | 27821 |
[s#(x1)] | = | 0 |
[nil] | = | 26497 |
[mark(x1)] | = | x1 + 0 |
[inf#(x1)] | = | 0 |
[active(x1)] | = | x1 + 0 |
[cons(x1, x2)] | = | x1 + 47339 |
[active#(x1)] | = | x1 + 0 |
[length(x1)] | = | x1 + 1324 |
[length#(x1)] | = | 0 |
[inf(x1)] | = | x1 + 47340 |
mark(length(X)) | → | active(length(mark(X))) | (18) |
active(inf(X)) | → | mark(cons(X,inf(s(X)))) | (4) |
mark(cons(X1,X2)) | → | active(cons(X1,X2)) | (15) |
active(length(cons(X,L))) | → | mark(s(length(L))) | (8) |
active(eq(0,0)) | → | mark(true) | (1) |
active(eq(X,Y)) | → | mark(false) | (3) |
mark(take(X1,X2)) | → | active(take(mark(X1),mark(X2))) | (16) |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
length(active(X)) | → | length(X) | (36) |
inf(active(X)) | → | inf(X) | (26) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
mark(nil) | → | active(nil) | (17) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
active(take(0,X)) | → | mark(nil) | (5) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
mark(0) | → | active(0) | (10) |
active(length(nil)) | → | mark(0) | (7) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
inf(mark(X)) | → | inf(X) | (25) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
mark(inf(X)) | → | active(inf(mark(X))) | (14) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
mark(s(X)) | → | active(s(X)) | (12) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
mark(true) | → | active(true) | (11) |
mark(eq(X1,X2)) | → | active(eq(X1,X2)) | (9) |
mark(false) | → | active(false) | (13) |
active(take(s(X),cons(Y,L))) | → | mark(cons(Y,take(X,L))) | (6) |
length(mark(X)) | → | length(X) | (35) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
active(eq(s(X),s(Y))) | → | mark(eq(X,Y)) | (2) |
active#(inf(X)) | → | mark#(cons(X,inf(s(X)))) | (56) |
mark#(length(X)) | → | mark#(X) | (50) |
mark#(inf(X)) | → | mark#(X) | (74) |
mark#(take(X1,X2)) | → | mark#(X2) | (47) |
active#(take(s(X),cons(Y,L))) | → | mark#(cons(Y,take(X,L))) | (68) |
mark#(take(X1,X2)) | → | mark#(X1) | (44) |
active#(length(cons(X,L))) | → | mark#(s(length(L))) | (43) |
The dependency pairs are split into 1 component.
mark#(length(X)) | → | active#(length(mark(X))) | (61) |
mark#(cons(X1,X2)) | → | active#(cons(X1,X2)) | (69) |
mark#(take(X1,X2)) | → | active#(take(mark(X1),mark(X2))) | (40) |
mark#(inf(X)) | → | active#(inf(mark(X))) | (84) |
mark#(s(X)) | → | active#(s(X)) | (51) |
mark#(eq(X1,X2)) | → | active#(eq(X1,X2)) | (52) |
active#(eq(s(X),s(Y))) | → | mark#(eq(X,Y)) | (82) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 5398 |
[take#(x1, x2)] | = | 0 |
[take(x1, x2)] | = | x1 + 5399 |
[eq(x1, x2)] | = | 5398 |
[false] | = | 17728 |
[true] | = | 8280 |
[eq#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 0 |
[0] | = | 29384 |
[s#(x1)] | = | 0 |
[nil] | = | 23984 |
[mark(x1)] | = | x1 + 33401 |
[inf#(x1)] | = | 0 |
[active(x1)] | = | x1 + 33401 |
[cons(x1, x2)] | = | x1 + 5398 |
[active#(x1)] | = | 5398 |
[length(x1)] | = | x1 + 5399 |
[length#(x1)] | = | 0 |
[inf(x1)] | = | 5399 |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
length(active(X)) | → | length(X) | (36) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
length(mark(X)) | → | length(X) | (35) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
mark#(length(X)) | → | active#(length(mark(X))) | (61) |
mark#(take(X1,X2)) | → | active#(take(mark(X1),mark(X2))) | (40) |
mark#(inf(X)) | → | active#(inf(mark(X))) | (84) |
The dependency pairs are split into 1 component.
mark#(cons(X1,X2)) | → | active#(cons(X1,X2)) | (69) |
mark#(s(X)) | → | active#(s(X)) | (51) |
mark#(eq(X1,X2)) | → | active#(eq(X1,X2)) | (52) |
active#(eq(s(X),s(Y))) | → | mark#(eq(X,Y)) | (82) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 4188 |
[take#(x1, x2)] | = | 0 |
[take(x1, x2)] | = | x1 + 1 |
[eq(x1, x2)] | = | 4187 |
[false] | = | 4188 |
[true] | = | 4188 |
[eq#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 1211 |
[0] | = | 31886 |
[s#(x1)] | = | 0 |
[nil] | = | 16913 |
[mark(x1)] | = | x1 + 56905 |
[inf#(x1)] | = | 0 |
[active(x1)] | = | x1 + 56905 |
[cons(x1, x2)] | = | x1 + 4188 |
[active#(x1)] | = | 5398 |
[length(x1)] | = | x1 + 14972 |
[length#(x1)] | = | 0 |
[inf(x1)] | = | 5399 |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
length(active(X)) | → | length(X) | (36) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
length(mark(X)) | → | length(X) | (35) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
mark#(cons(X1,X2)) | → | active#(cons(X1,X2)) | (69) |
mark#(s(X)) | → | active#(s(X)) | (51) |
The dependency pairs are split into 1 component.
mark#(eq(X1,X2)) | → | active#(eq(X1,X2)) | (52) |
active#(eq(s(X),s(Y))) | → | mark#(eq(X,Y)) | (82) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[take#(x1, x2)] | = | 0 |
[take(x1, x2)] | = | 43950 |
[eq(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 2 |
[true] | = | 98732 |
[eq#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 1211 |
[0] | = | 49365 |
[s#(x1)] | = | 0 |
[nil] | = | 43950 |
[mark(x1)] | = | x1 + 1 |
[inf#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 15620 |
[active#(x1)] | = | x1 + 1210 |
[length(x1)] | = | 49364 |
[length#(x1)] | = | 0 |
[inf(x1)] | = | 15620 |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
length(active(X)) | → | length(X) | (36) |
inf(active(X)) | → | inf(X) | (26) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
inf(mark(X)) | → | inf(X) | (25) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
length(mark(X)) | → | length(X) | (35) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
mark#(eq(X1,X2)) | → | active#(eq(X1,X2)) | (52) |
active#(eq(s(X),s(Y))) | → | mark#(eq(X,Y)) | (82) |
The dependency pairs are split into 0 components.
take#(X1,mark(X2)) | → | take#(X1,X2) | (60) |
take#(mark(X1),X2) | → | take#(X1,X2) | (59) |
take#(active(X1),X2) | → | take#(X1,X2) | (55) |
take#(X1,active(X2)) | → | take#(X1,X2) | (73) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[take#(x1, x2)] | = | x1 + x2 + 0 |
[take(x1, x2)] | = | 35082 |
[eq(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 2 |
[true] | = | 52106 |
[eq#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 1211 |
[0] | = | 26052 |
[s#(x1)] | = | 0 |
[nil] | = | 35082 |
[mark(x1)] | = | x1 + 1 |
[inf#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 5969 |
[active#(x1)] | = | x1 + 1210 |
[length(x1)] | = | 1 |
[length#(x1)] | = | 0 |
[inf(x1)] | = | 5969 |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
length(active(X)) | → | length(X) | (36) |
inf(active(X)) | → | inf(X) | (26) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
inf(mark(X)) | → | inf(X) | (25) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
length(mark(X)) | → | length(X) | (35) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
take#(X1,mark(X2)) | → | take#(X1,X2) | (60) |
take#(mark(X1),X2) | → | take#(X1,X2) | (59) |
take#(active(X1),X2) | → | take#(X1,X2) | (55) |
take#(X1,active(X2)) | → | take#(X1,X2) | (73) |
The dependency pairs are split into 0 components.
cons#(X1,active(X2)) | → | cons#(X1,X2) | (87) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (62) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (81) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (70) |
[cons#(x1, x2)] | = | x1 + x2 + 0 |
[s(x1)] | = | x1 + 1 |
[take#(x1, x2)] | = | 0 |
[take(x1, x2)] | = | 1 |
[eq(x1, x2)] | = | x1 + x2 + 55691 |
[false] | = | 55692 |
[true] | = | 208460 |
[eq#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 1211 |
[0] | = | 76384 |
[s#(x1)] | = | 0 |
[nil] | = | 1 |
[mark(x1)] | = | x1 + 1 |
[inf#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 1 |
[active#(x1)] | = | x1 + 1210 |
[length(x1)] | = | 44249 |
[length#(x1)] | = | 0 |
[inf(x1)] | = | 436 |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
length(active(X)) | → | length(X) | (36) |
inf(active(X)) | → | inf(X) | (26) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
inf(mark(X)) | → | inf(X) | (25) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
length(mark(X)) | → | length(X) | (35) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (87) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (62) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (81) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (70) |
The dependency pairs are split into 0 components.
inf#(active(X)) | → | inf#(X) | (75) |
inf#(mark(X)) | → | inf#(X) | (76) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[take#(x1, x2)] | = | 0 |
[take(x1, x2)] | = | 1 |
[eq(x1, x2)] | = | x1 + x2 + 4 |
[false] | = | 5 |
[true] | = | 12 |
[eq#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 1211 |
[0] | = | 3 |
[s#(x1)] | = | 0 |
[nil] | = | 1 |
[mark(x1)] | = | x1 + 1 |
[inf#(x1)] | = | x1 + 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 1 |
[active#(x1)] | = | x1 + 1210 |
[length(x1)] | = | 2 |
[length#(x1)] | = | 0 |
[inf(x1)] | = | 15081 |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
length(active(X)) | → | length(X) | (36) |
inf(active(X)) | → | inf(X) | (26) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
inf(mark(X)) | → | inf(X) | (25) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
length(mark(X)) | → | length(X) | (35) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
inf#(active(X)) | → | inf#(X) | (75) |
inf#(mark(X)) | → | inf#(X) | (76) |
The dependency pairs are split into 0 components.
s#(mark(X)) | → | s#(X) | (57) |
s#(active(X)) | → | s#(X) | (53) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[take#(x1, x2)] | = | 0 |
[take(x1, x2)] | = | 11495 |
[eq(x1, x2)] | = | x1 + x2 + 35616 |
[false] | = | 35617 |
[true] | = | 93887 |
[eq#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 1211 |
[0] | = | 29135 |
[s#(x1)] | = | x1 + 0 |
[nil] | = | 5481 |
[mark(x1)] | = | x1 + 1 |
[inf#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 1 |
[active#(x1)] | = | x1 + 1210 |
[length(x1)] | = | 1 |
[length#(x1)] | = | 0 |
[inf(x1)] | = | 28652 |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
length(active(X)) | → | length(X) | (36) |
inf(active(X)) | → | inf(X) | (26) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
inf(mark(X)) | → | inf(X) | (25) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
length(mark(X)) | → | length(X) | (35) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
s#(mark(X)) | → | s#(X) | (57) |
s#(active(X)) | → | s#(X) | (53) |
The dependency pairs are split into 0 components.
length#(mark(X)) | → | length#(X) | (85) |
length#(active(X)) | → | length#(X) | (67) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[take#(x1, x2)] | = | 0 |
[take(x1, x2)] | = | 52787 |
[eq(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 2 |
[true] | = | 39828 |
[eq#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 1211 |
[0] | = | 19913 |
[s#(x1)] | = | 0 |
[nil] | = | 52787 |
[mark(x1)] | = | x1 + 1 |
[inf#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 20631 |
[active#(x1)] | = | x1 + 1210 |
[length(x1)] | = | 19912 |
[length#(x1)] | = | x1 + 0 |
[inf(x1)] | = | 20631 |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
length(active(X)) | → | length(X) | (36) |
inf(active(X)) | → | inf(X) | (26) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
inf(mark(X)) | → | inf(X) | (25) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
length(mark(X)) | → | length(X) | (35) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
length#(mark(X)) | → | length#(X) | (85) |
length#(active(X)) | → | length#(X) | (67) |
The dependency pairs are split into 0 components.
eq#(mark(X1),X2) | → | eq#(X1,X2) | (58) |
eq#(X1,active(X2)) | → | eq#(X1,X2) | (77) |
eq#(active(X1),X2) | → | eq#(X1,X2) | (72) |
eq#(X1,mark(X2)) | → | eq#(X1,X2) | (63) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[take#(x1, x2)] | = | 0 |
[take(x1, x2)] | = | 64373 |
[eq(x1, x2)] | = | x1 + x2 + 24552 |
[false] | = | 44970 |
[true] | = | 24557 |
[eq#(x1, x2)] | = | x2 + 0 |
[mark#(x1)] | = | x1 + 1211 |
[0] | = | 2 |
[s#(x1)] | = | 0 |
[nil] | = | 64373 |
[mark(x1)] | = | x1 + 1 |
[inf#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 38169 |
[active#(x1)] | = | x1 + 1210 |
[length(x1)] | = | 1 |
[length#(x1)] | = | 0 |
[inf(x1)] | = | 38169 |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
length(active(X)) | → | length(X) | (36) |
inf(active(X)) | → | inf(X) | (26) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
inf(mark(X)) | → | inf(X) | (25) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
length(mark(X)) | → | length(X) | (35) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
eq#(X1,active(X2)) | → | eq#(X1,X2) | (77) |
eq#(X1,mark(X2)) | → | eq#(X1,X2) | (63) |
The dependency pairs are split into 1 component.
eq#(active(X1),X2) | → | eq#(X1,X2) | (72) |
eq#(mark(X1),X2) | → | eq#(X1,X2) | (58) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 15876 |
[take#(x1, x2)] | = | 0 |
[take(x1, x2)] | = | 42490 |
[eq(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 2 |
[true] | = | 24557 |
[eq#(x1, x2)] | = | x1 + 0 |
[mark#(x1)] | = | x1 + 1211 |
[0] | = | 2562 |
[s#(x1)] | = | 0 |
[nil] | = | 42490 |
[mark(x1)] | = | x1 + 1 |
[inf#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 42490 |
[active#(x1)] | = | x1 + 1210 |
[length(x1)] | = | 1 |
[length#(x1)] | = | 0 |
[inf(x1)] | = | 42490 |
eq(active(X1),X2) | → | eq(X1,X2) | (21) |
length(active(X)) | → | length(X) | (36) |
inf(active(X)) | → | inf(X) | (26) |
eq(mark(X1),X2) | → | eq(X1,X2) | (19) |
take(X1,mark(X2)) | → | take(X1,X2) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (27) |
take(X1,active(X2)) | → | take(X1,X2) | (34) |
eq(X1,active(X2)) | → | eq(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (28) |
take(active(X1),X2) | → | take(X1,X2) | (33) |
eq(X1,mark(X2)) | → | eq(X1,X2) | (20) |
inf(mark(X)) | → | inf(X) | (25) |
cons(X1,active(X2)) | → | cons(X1,X2) | (30) |
take(mark(X1),X2) | → | take(X1,X2) | (31) |
s(mark(X)) | → | s(X) | (23) |
s(active(X)) | → | s(X) | (24) |
length(mark(X)) | → | length(X) | (35) |
cons(active(X1),X2) | → | cons(X1,X2) | (29) |
eq#(active(X1),X2) | → | eq#(X1,X2) | (72) |
eq#(mark(X1),X2) | → | eq#(X1,X2) | (58) |
The dependency pairs are split into 0 components.