The rewrite relation of the following TRS is considered.
active(fst(0,Z)) | → | mark(nil) | (1) |
active(fst(s(X),cons(Y,Z))) | → | mark(cons(Y,fst(X,Z))) | (2) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (3) |
active(add(0,X)) | → | mark(X) | (4) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (5) |
active(len(nil)) | → | mark(0) | (6) |
active(len(cons(X,Z))) | → | mark(s(len(Z))) | (7) |
mark(fst(X1,X2)) | → | active(fst(mark(X1),mark(X2))) | (8) |
mark(0) | → | active(0) | (9) |
mark(nil) | → | active(nil) | (10) |
mark(s(X)) | → | active(s(X)) | (11) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (12) |
mark(from(X)) | → | active(from(mark(X))) | (13) |
mark(add(X1,X2)) | → | active(add(mark(X1),mark(X2))) | (14) |
mark(len(X)) | → | active(len(mark(X))) | (15) |
fst(mark(X1),X2) | → | fst(X1,X2) | (16) |
fst(X1,mark(X2)) | → | fst(X1,X2) | (17) |
fst(active(X1),X2) | → | fst(X1,X2) | (18) |
fst(X1,active(X2)) | → | fst(X1,X2) | (19) |
s(mark(X)) | → | s(X) | (20) |
s(active(X)) | → | s(X) | (21) |
cons(mark(X1),X2) | → | cons(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (23) |
cons(active(X1),X2) | → | cons(X1,X2) | (24) |
cons(X1,active(X2)) | → | cons(X1,X2) | (25) |
from(mark(X)) | → | from(X) | (26) |
from(active(X)) | → | from(X) | (27) |
add(mark(X1),X2) | → | add(X1,X2) | (28) |
add(X1,mark(X2)) | → | add(X1,X2) | (29) |
add(active(X1),X2) | → | add(X1,X2) | (30) |
add(X1,active(X2)) | → | add(X1,X2) | (31) |
len(mark(X)) | → | len(X) | (32) |
len(active(X)) | → | len(X) | (33) |
active#(fst(s(X),cons(Y,Z))) | → | cons#(Y,fst(X,Z)) | (34) |
active#(from(X)) | → | from#(s(X)) | (35) |
active#(add(s(X),Y)) | → | mark#(s(add(X,Y))) | (36) |
fst#(X1,mark(X2)) | → | fst#(X1,X2) | (37) |
mark#(fst(X1,X2)) | → | active#(fst(mark(X1),mark(X2))) | (38) |
active#(from(X)) | → | cons#(X,from(s(X))) | (39) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (40) |
fst#(X1,active(X2)) | → | fst#(X1,X2) | (41) |
mark#(fst(X1,X2)) | → | fst#(mark(X1),mark(X2)) | (42) |
active#(add(0,X)) | → | mark#(X) | (43) |
mark#(fst(X1,X2)) | → | mark#(X1) | (44) |
from#(mark(X)) | → | from#(X) | (45) |
mark#(from(X)) | → | active#(from(mark(X))) | (46) |
fst#(mark(X1),X2) | → | fst#(X1,X2) | (47) |
mark#(len(X)) | → | len#(mark(X)) | (48) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (49) |
mark#(0) | → | active#(0) | (50) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (51) |
active#(len(cons(X,Z))) | → | mark#(s(len(Z))) | (52) |
s#(mark(X)) | → | s#(X) | (53) |
active#(fst(0,Z)) | → | mark#(nil) | (54) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (55) |
active#(add(s(X),Y)) | → | add#(X,Y) | (56) |
mark#(cons(X1,X2)) | → | cons#(mark(X1),X2) | (57) |
active#(add(s(X),Y)) | → | s#(add(X,Y)) | (58) |
mark#(len(X)) | → | mark#(X) | (59) |
mark#(fst(X1,X2)) | → | mark#(X2) | (60) |
active#(len(cons(X,Z))) | → | s#(len(Z)) | (61) |
mark#(add(X1,X2)) | → | mark#(X2) | (62) |
mark#(from(X)) | → | from#(mark(X)) | (63) |
s#(active(X)) | → | s#(X) | (64) |
mark#(s(X)) | → | active#(s(X)) | (65) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (66) |
active#(len(nil)) | → | mark#(0) | (67) |
active#(from(X)) | → | s#(X) | (68) |
len#(active(X)) | → | len#(X) | (69) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (70) |
from#(active(X)) | → | from#(X) | (71) |
mark#(nil) | → | active#(nil) | (72) |
mark#(add(X1,X2)) | → | active#(add(mark(X1),mark(X2))) | (73) |
add#(mark(X1),X2) | → | add#(X1,X2) | (74) |
mark#(add(X1,X2)) | → | mark#(X1) | (75) |
active#(len(cons(X,Z))) | → | len#(Z) | (76) |
len#(mark(X)) | → | len#(X) | (77) |
add#(active(X1),X2) | → | add#(X1,X2) | (78) |
add#(X1,active(X2)) | → | add#(X1,X2) | (79) |
active#(fst(s(X),cons(Y,Z))) | → | fst#(X,Z) | (80) |
active#(fst(s(X),cons(Y,Z))) | → | mark#(cons(Y,fst(X,Z))) | (81) |
fst#(active(X1),X2) | → | fst#(X1,X2) | (82) |
mark#(from(X)) | → | mark#(X) | (83) |
mark#(cons(X1,X2)) | → | mark#(X1) | (84) |
add#(X1,mark(X2)) | → | add#(X1,X2) | (85) |
mark#(len(X)) | → | active#(len(mark(X))) | (86) |
mark#(add(X1,X2)) | → | add#(mark(X1),mark(X2)) | (87) |
The dependency pairs are split into 7 components.
mark#(len(X)) | → | active#(len(mark(X))) | (86) |
mark#(len(X)) | → | mark#(X) | (59) |
mark#(fst(X1,X2)) | → | mark#(X2) | (60) |
mark#(cons(X1,X2)) | → | mark#(X1) | (84) |
mark#(from(X)) | → | mark#(X) | (83) |
active#(fst(s(X),cons(Y,Z))) | → | mark#(cons(Y,fst(X,Z))) | (81) |
active#(len(cons(X,Z))) | → | mark#(s(len(Z))) | (52) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (49) |
mark#(add(X1,X2)) | → | mark#(X1) | (75) |
mark#(add(X1,X2)) | → | active#(add(mark(X1),mark(X2))) | (73) |
mark#(from(X)) | → | active#(from(mark(X))) | (46) |
mark#(fst(X1,X2)) | → | mark#(X1) | (44) |
active#(add(0,X)) | → | mark#(X) | (43) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (40) |
mark#(s(X)) | → | active#(s(X)) | (65) |
mark#(fst(X1,X2)) | → | active#(fst(mark(X1),mark(X2))) | (38) |
active#(add(s(X),Y)) | → | mark#(s(add(X,Y))) | (36) |
mark#(add(X1,X2)) | → | mark#(X2) | (62) |
[len#(x1)] | = | 0 |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 8386 |
[fst(x1, x2)] | = | x1 + x2 + 6296 |
[fst#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 14681 |
[0] | = | 297 |
[from(x1)] | = | x1 + 37749 |
[s#(x1)] | = | 0 |
[nil] | = | 402 |
[mark(x1)] | = | x1 + 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 0 |
[cons(x1, x2)] | = | x1 + 23067 |
[active#(x1)] | = | x1 + 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x1 + x2 + 14682 |
[len(x1)] | = | x1 + 1 |
fst(active(X1),X2) | → | fst(X1,X2) | (18) |
active(add(0,X)) | → | mark(X) | (4) |
mark(len(X)) | → | active(len(mark(X))) | (15) |
mark(fst(X1,X2)) | → | active(fst(mark(X1),mark(X2))) | (8) |
active(fst(0,Z)) | → | mark(nil) | (1) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (3) |
fst(mark(X1),X2) | → | fst(X1,X2) | (16) |
s(active(X)) | → | s(X) | (21) |
from(mark(X)) | → | from(X) | (26) |
fst(X1,active(X2)) | → | fst(X1,X2) | (19) |
len(mark(X)) | → | len(X) | (32) |
fst(X1,mark(X2)) | → | fst(X1,X2) | (17) |
from(active(X)) | → | from(X) | (27) |
cons(mark(X1),X2) | → | cons(X1,X2) | (22) |
add(mark(X1),X2) | → | add(X1,X2) | (28) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (5) |
len(active(X)) | → | len(X) | (33) |
mark(nil) | → | active(nil) | (10) |
active(len(cons(X,Z))) | → | mark(s(len(Z))) | (7) |
s(mark(X)) | → | s(X) | (20) |
cons(X1,active(X2)) | → | cons(X1,X2) | (25) |
add(active(X1),X2) | → | add(X1,X2) | (30) |
mark(add(X1,X2)) | → | active(add(mark(X1),mark(X2))) | (14) |
add(X1,active(X2)) | → | add(X1,X2) | (31) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (12) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (23) |
cons(active(X1),X2) | → | cons(X1,X2) | (24) |
mark(s(X)) | → | active(s(X)) | (11) |
mark(0) | → | active(0) | (9) |
mark(from(X)) | → | active(from(mark(X))) | (13) |
active(len(nil)) | → | mark(0) | (6) |
add(X1,mark(X2)) | → | add(X1,X2) | (29) |
active(fst(s(X),cons(Y,Z))) | → | mark(cons(Y,fst(X,Z))) | (2) |
mark#(len(X)) | → | active#(len(mark(X))) | (86) |
mark#(len(X)) | → | mark#(X) | (59) |
mark#(fst(X1,X2)) | → | mark#(X2) | (60) |
mark#(cons(X1,X2)) | → | mark#(X1) | (84) |
mark#(from(X)) | → | mark#(X) | (83) |
active#(fst(s(X),cons(Y,Z))) | → | mark#(cons(Y,fst(X,Z))) | (81) |
active#(len(cons(X,Z))) | → | mark#(s(len(Z))) | (52) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (49) |
mark#(add(X1,X2)) | → | mark#(X1) | (75) |
mark#(add(X1,X2)) | → | active#(add(mark(X1),mark(X2))) | (73) |
mark#(from(X)) | → | active#(from(mark(X))) | (46) |
mark#(fst(X1,X2)) | → | mark#(X1) | (44) |
active#(add(0,X)) | → | mark#(X) | (43) |
active#(from(X)) | → | mark#(cons(X,from(s(X)))) | (40) |
mark#(s(X)) | → | active#(s(X)) | (65) |
mark#(fst(X1,X2)) | → | active#(fst(mark(X1),mark(X2))) | (38) |
active#(add(s(X),Y)) | → | mark#(s(add(X,Y))) | (36) |
mark#(add(X1,X2)) | → | mark#(X2) | (62) |
The dependency pairs are split into 0 components.
add#(X1,mark(X2)) | → | add#(X1,X2) | (85) |
add#(X1,active(X2)) | → | add#(X1,X2) | (79) |
add#(active(X1),X2) | → | add#(X1,X2) | (78) |
add#(mark(X1),X2) | → | add#(X1,X2) | (74) |
[len#(x1)] | = | 0 |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 57757 |
[fst(x1, x2)] | = | 1 |
[fst#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 14681 |
[0] | = | 297 |
[from(x1)] | = | x1 + 2 |
[s#(x1)] | = | 0 |
[nil] | = | 7746 |
[mark(x1)] | = | x1 + 3 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 1 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | x2 + 0 |
[add(x1, x2)] | = | 1 |
[len(x1)] | = | 1 |
s(active(X)) | → | s(X) | (21) |
len(mark(X)) | → | len(X) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (22) |
add(mark(X1),X2) | → | add(X1,X2) | (28) |
len(active(X)) | → | len(X) | (33) |
s(mark(X)) | → | s(X) | (20) |
cons(X1,active(X2)) | → | cons(X1,X2) | (25) |
add(active(X1),X2) | → | add(X1,X2) | (30) |
add(X1,active(X2)) | → | add(X1,X2) | (31) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (23) |
cons(active(X1),X2) | → | cons(X1,X2) | (24) |
add(X1,mark(X2)) | → | add(X1,X2) | (29) |
add#(X1,mark(X2)) | → | add#(X1,X2) | (85) |
add#(X1,active(X2)) | → | add#(X1,X2) | (79) |
The dependency pairs are split into 1 component.
add#(mark(X1),X2) | → | add#(X1,X2) | (74) |
add#(active(X1),X2) | → | add#(X1,X2) | (78) |
[len#(x1)] | = | 0 |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 57757 |
[fst(x1, x2)] | = | 7177 |
[fst#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 14681 |
[0] | = | 297 |
[from(x1)] | = | x1 + 1 |
[s#(x1)] | = | 0 |
[nil] | = | 15837 |
[mark(x1)] | = | x1 + 3 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 43653 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | x1 + 0 |
[add(x1, x2)] | = | 1 |
[len(x1)] | = | 112 |
s(active(X)) | → | s(X) | (21) |
len(mark(X)) | → | len(X) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (22) |
add(mark(X1),X2) | → | add(X1,X2) | (28) |
len(active(X)) | → | len(X) | (33) |
s(mark(X)) | → | s(X) | (20) |
cons(X1,active(X2)) | → | cons(X1,X2) | (25) |
add(active(X1),X2) | → | add(X1,X2) | (30) |
add(X1,active(X2)) | → | add(X1,X2) | (31) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (23) |
cons(active(X1),X2) | → | cons(X1,X2) | (24) |
add(X1,mark(X2)) | → | add(X1,X2) | (29) |
add#(mark(X1),X2) | → | add#(X1,X2) | (74) |
add#(active(X1),X2) | → | add#(X1,X2) | (78) |
The dependency pairs are split into 0 components.
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (55) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (51) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (70) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (66) |
[len#(x1)] | = | 0 |
[cons#(x1, x2)] | = | x1 + x2 + 0 |
[s(x1)] | = | 27857 |
[fst(x1, x2)] | = | 2 |
[fst#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 14681 |
[0] | = | 297 |
[from(x1)] | = | x1 + 2 |
[s#(x1)] | = | 0 |
[nil] | = | 15837 |
[mark(x1)] | = | x1 + 3 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 1 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 1 |
[len(x1)] | = | 1 |
s(active(X)) | → | s(X) | (21) |
len(mark(X)) | → | len(X) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (22) |
add(mark(X1),X2) | → | add(X1,X2) | (28) |
len(active(X)) | → | len(X) | (33) |
s(mark(X)) | → | s(X) | (20) |
cons(X1,active(X2)) | → | cons(X1,X2) | (25) |
add(active(X1),X2) | → | add(X1,X2) | (30) |
add(X1,active(X2)) | → | add(X1,X2) | (31) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (23) |
cons(active(X1),X2) | → | cons(X1,X2) | (24) |
add(X1,mark(X2)) | → | add(X1,X2) | (29) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (55) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (51) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (70) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (66) |
The dependency pairs are split into 0 components.
from#(mark(X)) | → | from#(X) | (45) |
from#(active(X)) | → | from#(X) | (71) |
[len#(x1)] | = | 0 |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 1 |
[fst(x1, x2)] | = | 2 |
[fst#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 14681 |
[0] | = | 42085 |
[from(x1)] | = | x1 + 2743 |
[s#(x1)] | = | 0 |
[nil] | = | 44079 |
[mark(x1)] | = | x1 + 3 |
[from#(x1)] | = | x1 + 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 31934 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 1 |
[len(x1)] | = | 2 |
s(active(X)) | → | s(X) | (21) |
len(mark(X)) | → | len(X) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (22) |
add(mark(X1),X2) | → | add(X1,X2) | (28) |
len(active(X)) | → | len(X) | (33) |
s(mark(X)) | → | s(X) | (20) |
cons(X1,active(X2)) | → | cons(X1,X2) | (25) |
add(active(X1),X2) | → | add(X1,X2) | (30) |
add(X1,active(X2)) | → | add(X1,X2) | (31) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (23) |
cons(active(X1),X2) | → | cons(X1,X2) | (24) |
add(X1,mark(X2)) | → | add(X1,X2) | (29) |
from#(mark(X)) | → | from#(X) | (45) |
from#(active(X)) | → | from#(X) | (71) |
The dependency pairs are split into 0 components.
s#(mark(X)) | → | s#(X) | (53) |
s#(active(X)) | → | s#(X) | (64) |
[len#(x1)] | = | 0 |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 1 |
[fst(x1, x2)] | = | 3047 |
[fst#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 14681 |
[0] | = | 42085 |
[from(x1)] | = | x1 + 1 |
[s#(x1)] | = | x1 + 0 |
[nil] | = | 24198 |
[mark(x1)] | = | x1 + 19046 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 54921 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 19044 |
[len(x1)] | = | 11575 |
s(active(X)) | → | s(X) | (21) |
len(mark(X)) | → | len(X) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (22) |
add(mark(X1),X2) | → | add(X1,X2) | (28) |
len(active(X)) | → | len(X) | (33) |
s(mark(X)) | → | s(X) | (20) |
cons(X1,active(X2)) | → | cons(X1,X2) | (25) |
add(active(X1),X2) | → | add(X1,X2) | (30) |
add(X1,active(X2)) | → | add(X1,X2) | (31) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (23) |
cons(active(X1),X2) | → | cons(X1,X2) | (24) |
add(X1,mark(X2)) | → | add(X1,X2) | (29) |
s#(mark(X)) | → | s#(X) | (53) |
s#(active(X)) | → | s#(X) | (64) |
The dependency pairs are split into 0 components.
fst#(active(X1),X2) | → | fst#(X1,X2) | (82) |
fst#(mark(X1),X2) | → | fst#(X1,X2) | (47) |
fst#(X1,active(X2)) | → | fst#(X1,X2) | (41) |
fst#(X1,mark(X2)) | → | fst#(X1,X2) | (37) |
[len#(x1)] | = | 0 |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 22775 |
[fst(x1, x2)] | = | 12701 |
[fst#(x1, x2)] | = | x1 + x2 + 0 |
[mark#(x1)] | = | x1 + 14681 |
[0] | = | 19642 |
[from(x1)] | = | x1 + 14923 |
[s#(x1)] | = | 0 |
[nil] | = | 24198 |
[mark(x1)] | = | x1 + 46871 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 36560 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 46869 |
[len(x1)] | = | 25728 |
s(active(X)) | → | s(X) | (21) |
len(mark(X)) | → | len(X) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (22) |
add(mark(X1),X2) | → | add(X1,X2) | (28) |
len(active(X)) | → | len(X) | (33) |
s(mark(X)) | → | s(X) | (20) |
cons(X1,active(X2)) | → | cons(X1,X2) | (25) |
add(active(X1),X2) | → | add(X1,X2) | (30) |
add(X1,active(X2)) | → | add(X1,X2) | (31) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (23) |
cons(active(X1),X2) | → | cons(X1,X2) | (24) |
add(X1,mark(X2)) | → | add(X1,X2) | (29) |
fst#(active(X1),X2) | → | fst#(X1,X2) | (82) |
fst#(mark(X1),X2) | → | fst#(X1,X2) | (47) |
fst#(X1,active(X2)) | → | fst#(X1,X2) | (41) |
fst#(X1,mark(X2)) | → | fst#(X1,X2) | (37) |
The dependency pairs are split into 0 components.
len#(mark(X)) | → | len#(X) | (77) |
len#(active(X)) | → | len#(X) | (69) |
[len#(x1)] | = | x1 + 0 |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 29273 |
[fst(x1, x2)] | = | 436 |
[fst#(x1, x2)] | = | 0 |
[mark#(x1)] | = | x1 + 14681 |
[0] | = | 58185 |
[from(x1)] | = | x1 + 14459 |
[s#(x1)] | = | 0 |
[nil] | = | 41866 |
[mark(x1)] | = | x1 + 32573 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + 32499 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 32571 |
[len(x1)] | = | 32582 |
s(active(X)) | → | s(X) | (21) |
len(mark(X)) | → | len(X) | (32) |
cons(mark(X1),X2) | → | cons(X1,X2) | (22) |
add(mark(X1),X2) | → | add(X1,X2) | (28) |
len(active(X)) | → | len(X) | (33) |
s(mark(X)) | → | s(X) | (20) |
cons(X1,active(X2)) | → | cons(X1,X2) | (25) |
add(active(X1),X2) | → | add(X1,X2) | (30) |
add(X1,active(X2)) | → | add(X1,X2) | (31) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (23) |
cons(active(X1),X2) | → | cons(X1,X2) | (24) |
add(X1,mark(X2)) | → | add(X1,X2) | (29) |
len#(mark(X)) | → | len#(X) | (77) |
len#(active(X)) | → | len#(X) | (69) |
The dependency pairs are split into 0 components.