The rewrite relation of the following TRS is considered.
active(f(X)) | → | mark(cons(X,f(g(X)))) | (1) |
active(g(0)) | → | mark(s(0)) | (2) |
active(g(s(X))) | → | mark(s(s(g(X)))) | (3) |
active(sel(0,cons(X,Y))) | → | mark(X) | (4) |
active(sel(s(X),cons(Y,Z))) | → | mark(sel(X,Z)) | (5) |
mark(f(X)) | → | active(f(mark(X))) | (6) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (7) |
mark(g(X)) | → | active(g(mark(X))) | (8) |
mark(0) | → | active(0) | (9) |
mark(s(X)) | → | active(s(mark(X))) | (10) |
mark(sel(X1,X2)) | → | active(sel(mark(X1),mark(X2))) | (11) |
f(mark(X)) | → | f(X) | (12) |
f(active(X)) | → | f(X) | (13) |
cons(mark(X1),X2) | → | cons(X1,X2) | (14) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (15) |
cons(active(X1),X2) | → | cons(X1,X2) | (16) |
cons(X1,active(X2)) | → | cons(X1,X2) | (17) |
g(mark(X)) | → | g(X) | (18) |
g(active(X)) | → | g(X) | (19) |
s(mark(X)) | → | s(X) | (20) |
s(active(X)) | → | s(X) | (21) |
sel(mark(X1),X2) | → | sel(X1,X2) | (22) |
sel(X1,mark(X2)) | → | sel(X1,X2) | (23) |
sel(active(X1),X2) | → | sel(X1,X2) | (24) |
sel(X1,active(X2)) | → | sel(X1,X2) | (25) |
active#(g(0)) | → | s#(0) | (26) |
active#(sel(0,cons(X,Y))) | → | mark#(X) | (27) |
s#(active(X)) | → | s#(X) | (28) |
active#(f(X)) | → | mark#(cons(X,f(g(X)))) | (29) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (30) |
mark#(g(X)) | → | mark#(X) | (31) |
active#(f(X)) | → | f#(g(X)) | (32) |
active#(f(X)) | → | g#(X) | (33) |
f#(active(X)) | → | f#(X) | (34) |
mark#(g(X)) | → | g#(mark(X)) | (35) |
sel#(X1,mark(X2)) | → | sel#(X1,X2) | (36) |
mark#(sel(X1,X2)) | → | sel#(mark(X1),mark(X2)) | (37) |
mark#(sel(X1,X2)) | → | mark#(X2) | (38) |
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (39) |
mark#(s(X)) | → | mark#(X) | (40) |
sel#(active(X1),X2) | → | sel#(X1,X2) | (41) |
active#(g(s(X))) | → | mark#(s(s(g(X)))) | (42) |
f#(mark(X)) | → | f#(X) | (43) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (44) |
active#(sel(s(X),cons(Y,Z))) | → | sel#(X,Z) | (45) |
mark#(cons(X1,X2)) | → | mark#(X1) | (46) |
mark#(0) | → | active#(0) | (47) |
mark#(g(X)) | → | active#(g(mark(X))) | (48) |
mark#(sel(X1,X2)) | → | mark#(X1) | (49) |
active#(g(s(X))) | → | s#(g(X)) | (50) |
mark#(f(X)) | → | mark#(X) | (51) |
g#(mark(X)) | → | g#(X) | (52) |
g#(active(X)) | → | g#(X) | (53) |
mark#(s(X)) | → | s#(mark(X)) | (54) |
active#(g(s(X))) | → | g#(X) | (55) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (56) |
s#(mark(X)) | → | s#(X) | (57) |
active#(g(s(X))) | → | s#(s(g(X))) | (58) |
mark#(cons(X1,X2)) | → | cons#(mark(X1),X2) | (59) |
sel#(mark(X1),X2) | → | sel#(X1,X2) | (60) |
active#(f(X)) | → | cons#(X,f(g(X))) | (61) |
mark#(s(X)) | → | active#(s(mark(X))) | (62) |
sel#(X1,active(X2)) | → | sel#(X1,X2) | (63) |
mark#(f(X)) | → | active#(f(mark(X))) | (64) |
active#(g(0)) | → | mark#(s(0)) | (65) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (66) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (67) |
mark#(f(X)) | → | f#(mark(X)) | (68) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (69) |
The dependency pairs are split into 6 components.
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (69) |
active#(g(s(X))) | → | mark#(s(s(g(X)))) | (42) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (66) |
active#(g(0)) | → | mark#(s(0)) | (65) |
mark#(s(X)) | → | mark#(X) | (40) |
mark#(f(X)) | → | active#(f(mark(X))) | (64) |
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (39) |
mark#(s(X)) | → | active#(s(mark(X))) | (62) |
mark#(sel(X1,X2)) | → | mark#(X2) | (38) |
mark#(f(X)) | → | mark#(X) | (51) |
mark#(g(X)) | → | mark#(X) | (31) |
mark#(sel(X1,X2)) | → | mark#(X1) | (49) |
mark#(g(X)) | → | active#(g(mark(X))) | (48) |
active#(f(X)) | → | mark#(cons(X,f(g(X)))) | (29) |
active#(sel(0,cons(X,Y))) | → | mark#(X) | (27) |
mark#(cons(X1,X2)) | → | mark#(X1) | (46) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 1143 |
[f(x1)] | = | 1144 |
[mark#(x1)] | = | 1144 |
[0] | = | 1 |
[sel#(x1, x2)] | = | 0 |
[sel(x1, x2)] | = | 1144 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | 1 |
[f#(x1)] | = | 0 |
[g#(x1)] | = | 0 |
[active(x1)] | = | 1 |
[cons(x1, x2)] | = | 1107 |
[active#(x1)] | = | x1 + 0 |
[g(x1)] | = | 1144 |
g(mark(X)) | → | g(X) | (18) |
active(sel(0,cons(X,Y))) | → | mark(X) | (4) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (15) |
mark(g(X)) | → | active(g(mark(X))) | (8) |
active(f(X)) | → | mark(cons(X,f(g(X)))) | (1) |
active(g(s(X))) | → | mark(s(s(g(X)))) | (3) |
cons(active(X1),X2) | → | cons(X1,X2) | (16) |
s(active(X)) | → | s(X) | (21) |
g(active(X)) | → | g(X) | (19) |
cons(X1,active(X2)) | → | cons(X1,X2) | (17) |
sel(mark(X1),X2) | → | sel(X1,X2) | (22) |
active(sel(s(X),cons(Y,Z))) | → | mark(sel(X,Z)) | (5) |
mark(s(X)) | → | active(s(mark(X))) | (10) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (7) |
s(mark(X)) | → | s(X) | (20) |
sel(X1,active(X2)) | → | sel(X1,X2) | (25) |
cons(mark(X1),X2) | → | cons(X1,X2) | (14) |
f(mark(X)) | → | f(X) | (12) |
sel(X1,mark(X2)) | → | sel(X1,X2) | (23) |
sel(active(X1),X2) | → | sel(X1,X2) | (24) |
mark(sel(X1,X2)) | → | active(sel(mark(X1),mark(X2))) | (11) |
mark(0) | → | active(0) | (9) |
f(active(X)) | → | f(X) | (13) |
mark(f(X)) | → | active(f(mark(X))) | (6) |
active(g(0)) | → | mark(s(0)) | (2) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (69) |
mark#(s(X)) | → | active#(s(mark(X))) | (62) |
The dependency pairs are split into 1 component.
active#(sel(0,cons(X,Y))) | → | mark#(X) | (27) |
mark#(g(X)) | → | mark#(X) | (31) |
mark#(g(X)) | → | active#(g(mark(X))) | (48) |
active#(f(X)) | → | mark#(cons(X,f(g(X)))) | (29) |
active#(g(s(X))) | → | mark#(s(s(g(X)))) | (42) |
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (39) |
mark#(s(X)) | → | mark#(X) | (40) |
mark#(cons(X1,X2)) | → | mark#(X1) | (46) |
mark#(sel(X1,X2)) | → | mark#(X2) | (38) |
mark#(sel(X1,X2)) | → | mark#(X1) | (49) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (66) |
mark#(f(X)) | → | mark#(X) | (51) |
mark#(f(X)) | → | active#(f(mark(X))) | (64) |
active#(g(0)) | → | mark#(s(0)) | (65) |
[cons#(x1, x2)] | = | max(0) |
[s(x1)] | = | x1 + 0 |
[f(x1)] | = | x1 + 2999 |
[mark#(x1)] | = | x1 + 0 |
[0] | = | 35657 |
[sel#(x1, x2)] | = | max(0) |
[sel(x1, x2)] | = | max(x1 + 1, x2 + 2, 0) |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 0 |
[f#(x1)] | = | 0 |
[g#(x1)] | = | 0 |
[active(x1)] | = | x1 + 0 |
[cons(x1, x2)] | = | max(x1 + 2998, x2 + 0, 0) |
[active#(x1)] | = | x1 + 0 |
[g(x1)] | = | x1 + 0 |
g(mark(X)) | → | g(X) | (18) |
active(sel(0,cons(X,Y))) | → | mark(X) | (4) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (15) |
mark(g(X)) | → | active(g(mark(X))) | (8) |
active(f(X)) | → | mark(cons(X,f(g(X)))) | (1) |
active(g(s(X))) | → | mark(s(s(g(X)))) | (3) |
cons(active(X1),X2) | → | cons(X1,X2) | (16) |
s(active(X)) | → | s(X) | (21) |
g(active(X)) | → | g(X) | (19) |
cons(X1,active(X2)) | → | cons(X1,X2) | (17) |
sel(mark(X1),X2) | → | sel(X1,X2) | (22) |
active(sel(s(X),cons(Y,Z))) | → | mark(sel(X,Z)) | (5) |
mark(s(X)) | → | active(s(mark(X))) | (10) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (7) |
s(mark(X)) | → | s(X) | (20) |
sel(X1,active(X2)) | → | sel(X1,X2) | (25) |
cons(mark(X1),X2) | → | cons(X1,X2) | (14) |
f(mark(X)) | → | f(X) | (12) |
sel(X1,mark(X2)) | → | sel(X1,X2) | (23) |
sel(active(X1),X2) | → | sel(X1,X2) | (24) |
mark(sel(X1,X2)) | → | active(sel(mark(X1),mark(X2))) | (11) |
mark(0) | → | active(0) | (9) |
f(active(X)) | → | f(X) | (13) |
mark(f(X)) | → | active(f(mark(X))) | (6) |
active(g(0)) | → | mark(s(0)) | (2) |
active#(sel(0,cons(X,Y))) | → | mark#(X) | (27) |
mark#(cons(X1,X2)) | → | mark#(X1) | (46) |
mark#(sel(X1,X2)) | → | mark#(X2) | (38) |
mark#(sel(X1,X2)) | → | mark#(X1) | (49) |
mark#(f(X)) | → | mark#(X) | (51) |
The dependency pairs are split into 1 component.
mark#(g(X)) | → | mark#(X) | (31) |
mark#(g(X)) | → | active#(g(mark(X))) | (48) |
active#(f(X)) | → | mark#(cons(X,f(g(X)))) | (29) |
active#(g(s(X))) | → | mark#(s(s(g(X)))) | (42) |
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (39) |
mark#(s(X)) | → | mark#(X) | (40) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (66) |
mark#(f(X)) | → | active#(f(mark(X))) | (64) |
active#(g(0)) | → | mark#(s(0)) | (65) |
π(cons#) | = | 1 |
π(mark#) | = | 1 |
π(mark) | = | 1 |
π(f#) | = | 1 |
π(active) | = | 1 |
π(active#) | = | 1 |
prec(s) | = | 0 | status(s) | = | [1] | list-extension(s) | = | Lex | ||
prec(f) | = | 3 | status(f) | = | [1] | list-extension(f) | = | Lex | ||
prec(0) | = | 1 | status(0) | = | [] | list-extension(0) | = | Lex | ||
prec(sel#) | = | 0 | status(sel#) | = | [] | list-extension(sel#) | = | Lex | ||
prec(sel) | = | 3 | status(sel) | = | [] | list-extension(sel) | = | Lex | ||
prec(s#) | = | 0 | status(s#) | = | [] | list-extension(s#) | = | Lex | ||
prec(g#) | = | 0 | status(g#) | = | [] | list-extension(g#) | = | Lex | ||
prec(cons) | = | 3 | status(cons) | = | [] | list-extension(cons) | = | Lex | ||
prec(g) | = | 2 | status(g) | = | [1] | list-extension(g) | = | Lex |
[s(x1)] | = | x1 + 0 |
[f(x1)] | = | x1 + 17221 |
[0] | = | 33036 |
[sel#(x1, x2)] | = | x1 + 1 |
[sel(x1, x2)] | = | x2 + 2438 |
[s#(x1)] | = | 1 |
[g#(x1)] | = | 1 |
[cons(x1, x2)] | = | max(x1 + 0, x2 + 0, 0) |
[g(x1)] | = | x1 + 0 |
g(mark(X)) | → | g(X) | (18) |
active(sel(0,cons(X,Y))) | → | mark(X) | (4) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (15) |
mark(g(X)) | → | active(g(mark(X))) | (8) |
active(f(X)) | → | mark(cons(X,f(g(X)))) | (1) |
active(g(s(X))) | → | mark(s(s(g(X)))) | (3) |
cons(active(X1),X2) | → | cons(X1,X2) | (16) |
s(active(X)) | → | s(X) | (21) |
g(active(X)) | → | g(X) | (19) |
cons(X1,active(X2)) | → | cons(X1,X2) | (17) |
sel(mark(X1),X2) | → | sel(X1,X2) | (22) |
active(sel(s(X),cons(Y,Z))) | → | mark(sel(X,Z)) | (5) |
mark(s(X)) | → | active(s(mark(X))) | (10) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (7) |
s(mark(X)) | → | s(X) | (20) |
sel(X1,active(X2)) | → | sel(X1,X2) | (25) |
cons(mark(X1),X2) | → | cons(X1,X2) | (14) |
f(mark(X)) | → | f(X) | (12) |
sel(X1,mark(X2)) | → | sel(X1,X2) | (23) |
sel(active(X1),X2) | → | sel(X1,X2) | (24) |
mark(sel(X1,X2)) | → | active(sel(mark(X1),mark(X2))) | (11) |
mark(0) | → | active(0) | (9) |
f(active(X)) | → | f(X) | (13) |
mark(f(X)) | → | active(f(mark(X))) | (6) |
active(g(0)) | → | mark(s(0)) | (2) |
mark#(g(X)) | → | mark#(X) | (31) |
active#(f(X)) | → | mark#(cons(X,f(g(X)))) | (29) |
active#(g(s(X))) | → | mark#(s(s(g(X)))) | (42) |
mark#(s(X)) | → | mark#(X) | (40) |
active#(g(0)) | → | mark#(s(0)) | (65) |
The dependency pairs are split into 1 component.
mark#(g(X)) | → | active#(g(mark(X))) | (48) |
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (39) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (66) |
mark#(f(X)) | → | active#(f(mark(X))) | (64) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 1 |
[f(x1)] | = | 36412 |
[mark#(x1)] | = | 36413 |
[0] | = | 1 |
[sel#(x1, x2)] | = | 0 |
[sel(x1, x2)] | = | 36413 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | 1 |
[f#(x1)] | = | 0 |
[g#(x1)] | = | 0 |
[active(x1)] | = | 2 |
[cons(x1, x2)] | = | 1 |
[active#(x1)] | = | x1 + 0 |
[g(x1)] | = | 1 |
g(mark(X)) | → | g(X) | (18) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (15) |
cons(active(X1),X2) | → | cons(X1,X2) | (16) |
s(active(X)) | → | s(X) | (21) |
g(active(X)) | → | g(X) | (19) |
cons(X1,active(X2)) | → | cons(X1,X2) | (17) |
sel(mark(X1),X2) | → | sel(X1,X2) | (22) |
s(mark(X)) | → | s(X) | (20) |
sel(X1,active(X2)) | → | sel(X1,X2) | (25) |
cons(mark(X1),X2) | → | cons(X1,X2) | (14) |
f(mark(X)) | → | f(X) | (12) |
sel(X1,mark(X2)) | → | sel(X1,X2) | (23) |
sel(active(X1),X2) | → | sel(X1,X2) | (24) |
f(active(X)) | → | f(X) | (13) |
mark#(g(X)) | → | active#(g(mark(X))) | (48) |
mark#(f(X)) | → | active#(f(mark(X))) | (64) |
The dependency pairs are split into 1 component.
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (39) |
mark#(sel(X1,X2)) | → | active#(sel(mark(X1),mark(X2))) | (66) |
π(cons#) | = | 1 |
π(mark#) | = | 1 |
π(mark) | = | 1 |
π(f#) | = | 1 |
π(active) | = | 1 |
π(active#) | = | 1 |
prec(s) | = | 1 | status(s) | = | [1] | list-extension(s) | = | Lex | ||
prec(f) | = | 3 | status(f) | = | [1] | list-extension(f) | = | Lex | ||
prec(0) | = | 0 | status(0) | = | [] | list-extension(0) | = | Lex | ||
prec(sel#) | = | 0 | status(sel#) | = | [] | list-extension(sel#) | = | Lex | ||
prec(sel) | = | 2 | status(sel) | = | [1] | list-extension(sel) | = | Lex | ||
prec(s#) | = | 0 | status(s#) | = | [] | list-extension(s#) | = | Lex | ||
prec(g#) | = | 0 | status(g#) | = | [] | list-extension(g#) | = | Lex | ||
prec(cons) | = | 3 | status(cons) | = | [] | list-extension(cons) | = | Lex | ||
prec(g) | = | 2 | status(g) | = | [1] | list-extension(g) | = | Lex |
[s(x1)] | = | x1 + 0 |
[f(x1)] | = | x1 + 28101 |
[0] | = | 34178 |
[sel#(x1, x2)] | = | x1 + 1 |
[sel(x1, x2)] | = | x1 + x2 + 5854 |
[s#(x1)] | = | 1 |
[g#(x1)] | = | 1 |
[cons(x1, x2)] | = | max(x1 + 0, x2 + 0, 0) |
[g(x1)] | = | x1 + 0 |
g(mark(X)) | → | g(X) | (18) |
active(sel(0,cons(X,Y))) | → | mark(X) | (4) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (15) |
mark(g(X)) | → | active(g(mark(X))) | (8) |
active(f(X)) | → | mark(cons(X,f(g(X)))) | (1) |
active(g(s(X))) | → | mark(s(s(g(X)))) | (3) |
cons(active(X1),X2) | → | cons(X1,X2) | (16) |
s(active(X)) | → | s(X) | (21) |
g(active(X)) | → | g(X) | (19) |
cons(X1,active(X2)) | → | cons(X1,X2) | (17) |
sel(mark(X1),X2) | → | sel(X1,X2) | (22) |
active(sel(s(X),cons(Y,Z))) | → | mark(sel(X,Z)) | (5) |
mark(s(X)) | → | active(s(mark(X))) | (10) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (7) |
s(mark(X)) | → | s(X) | (20) |
sel(X1,active(X2)) | → | sel(X1,X2) | (25) |
cons(mark(X1),X2) | → | cons(X1,X2) | (14) |
f(mark(X)) | → | f(X) | (12) |
sel(X1,mark(X2)) | → | sel(X1,X2) | (23) |
sel(active(X1),X2) | → | sel(X1,X2) | (24) |
mark(sel(X1,X2)) | → | active(sel(mark(X1),mark(X2))) | (11) |
mark(0) | → | active(0) | (9) |
f(active(X)) | → | f(X) | (13) |
mark(f(X)) | → | active(f(mark(X))) | (6) |
active(g(0)) | → | mark(s(0)) | (2) |
active#(sel(s(X),cons(Y,Z))) | → | mark#(sel(X,Z)) | (39) |
The dependency pairs are split into 0 components.
sel#(active(X1),X2) | → | sel#(X1,X2) | (41) |
sel#(X1,active(X2)) | → | sel#(X1,X2) | (63) |
sel#(mark(X1),X2) | → | sel#(X1,X2) | (60) |
sel#(X1,mark(X2)) | → | sel#(X1,X2) | (36) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 21598 |
[f(x1)] | = | 0 |
[mark#(x1)] | = | 0 |
[0] | = | 1 |
[sel#(x1, x2)] | = | x1 + x2 + 0 |
[sel(x1, x2)] | = | 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 7177 |
[f#(x1)] | = | 0 |
[g#(x1)] | = | 0 |
[active(x1)] | = | x1 + 26442 |
[cons(x1, x2)] | = | x1 + 19266 |
[active#(x1)] | = | 1 |
[g(x1)] | = | 2332 |
s(active(X)) | → | s(X) | (21) |
s(mark(X)) | → | s(X) | (20) |
sel#(active(X1),X2) | → | sel#(X1,X2) | (41) |
sel#(X1,active(X2)) | → | sel#(X1,X2) | (63) |
sel#(mark(X1),X2) | → | sel#(X1,X2) | (60) |
sel#(X1,mark(X2)) | → | sel#(X1,X2) | (36) |
The dependency pairs are split into 0 components.
cons#(active(X1),X2) | → | cons#(X1,X2) | (44) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (67) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (56) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (30) |
[cons#(x1, x2)] | = | x1 + 0 |
[s(x1)] | = | 20369 |
[f(x1)] | = | 0 |
[mark#(x1)] | = | 0 |
[0] | = | 1 |
[sel#(x1, x2)] | = | 0 |
[sel(x1, x2)] | = | 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 7177 |
[f#(x1)] | = | 0 |
[g#(x1)] | = | 0 |
[active(x1)] | = | x1 + 26442 |
[cons(x1, x2)] | = | x1 + 19266 |
[active#(x1)] | = | 1 |
[g(x1)] | = | 1 |
s(active(X)) | → | s(X) | (21) |
s(mark(X)) | → | s(X) | (20) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (44) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (67) |
The dependency pairs are split into 1 component.
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (30) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (56) |
[cons#(x1, x2)] | = | x2 + 0 |
[s(x1)] | = | 52721 |
[f(x1)] | = | 0 |
[mark#(x1)] | = | 0 |
[0] | = | 1 |
[sel#(x1, x2)] | = | 0 |
[sel(x1, x2)] | = | 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 7177 |
[f#(x1)] | = | 0 |
[g#(x1)] | = | 0 |
[active(x1)] | = | x1 + 26442 |
[cons(x1, x2)] | = | x1 + 19266 |
[active#(x1)] | = | 1 |
[g(x1)] | = | 33455 |
s(active(X)) | → | s(X) | (21) |
s(mark(X)) | → | s(X) | (20) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (30) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (56) |
The dependency pairs are split into 0 components.
f#(mark(X)) | → | f#(X) | (43) |
f#(active(X)) | → | f#(X) | (34) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 37163 |
[f(x1)] | = | 0 |
[mark#(x1)] | = | 0 |
[0] | = | 1 |
[sel#(x1, x2)] | = | 0 |
[sel(x1, x2)] | = | 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 7177 |
[f#(x1)] | = | x1 + 0 |
[g#(x1)] | = | 0 |
[active(x1)] | = | x1 + 26442 |
[cons(x1, x2)] | = | x1 + 35969 |
[active#(x1)] | = | 1 |
[g(x1)] | = | 17897 |
s(active(X)) | → | s(X) | (21) |
s(mark(X)) | → | s(X) | (20) |
f#(mark(X)) | → | f#(X) | (43) |
f#(active(X)) | → | f#(X) | (34) |
The dependency pairs are split into 0 components.
s#(mark(X)) | → | s#(X) | (57) |
s#(active(X)) | → | s#(X) | (28) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 3 |
[f(x1)] | = | 0 |
[mark#(x1)] | = | 0 |
[0] | = | 1 |
[sel#(x1, x2)] | = | 0 |
[sel(x1, x2)] | = | 0 |
[s#(x1)] | = | x1 + 0 |
[mark(x1)] | = | x1 + 7177 |
[f#(x1)] | = | 0 |
[g#(x1)] | = | 0 |
[active(x1)] | = | x1 + 7178 |
[cons(x1, x2)] | = | x1 + 2 |
[active#(x1)] | = | 1 |
[g(x1)] | = | 1 |
s(active(X)) | → | s(X) | (21) |
s(mark(X)) | → | s(X) | (20) |
s#(mark(X)) | → | s#(X) | (57) |
s#(active(X)) | → | s#(X) | (28) |
The dependency pairs are split into 0 components.
g#(active(X)) | → | g#(X) | (53) |
g#(mark(X)) | → | g#(X) | (52) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 6993 |
[f(x1)] | = | 0 |
[mark#(x1)] | = | 0 |
[0] | = | 1 |
[sel#(x1, x2)] | = | 0 |
[sel(x1, x2)] | = | 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 7177 |
[f#(x1)] | = | 0 |
[g#(x1)] | = | x1 + 0 |
[active(x1)] | = | x1 + 7178 |
[cons(x1, x2)] | = | x1 + 2 |
[active#(x1)] | = | 1 |
[g(x1)] | = | 6991 |
s(active(X)) | → | s(X) | (21) |
s(mark(X)) | → | s(X) | (20) |
g#(active(X)) | → | g#(X) | (53) |
g#(mark(X)) | → | g#(X) | (52) |
The dependency pairs are split into 0 components.