The rewrite relation of the following TRS is considered.
a__fst(0,Z) | → | nil | (1) |
a__fst(s(X),cons(Y,Z)) | → | cons(mark(Y),fst(X,Z)) | (2) |
a__from(X) | → | cons(mark(X),from(s(X))) | (3) |
a__add(0,X) | → | mark(X) | (4) |
a__add(s(X),Y) | → | s(add(X,Y)) | (5) |
a__len(nil) | → | 0 | (6) |
a__len(cons(X,Z)) | → | s(len(Z)) | (7) |
mark(fst(X1,X2)) | → | a__fst(mark(X1),mark(X2)) | (8) |
mark(from(X)) | → | a__from(mark(X)) | (9) |
mark(add(X1,X2)) | → | a__add(mark(X1),mark(X2)) | (10) |
mark(len(X)) | → | a__len(mark(X)) | (11) |
mark(0) | → | 0 | (12) |
mark(s(X)) | → | s(X) | (13) |
mark(nil) | → | nil | (14) |
mark(cons(X1,X2)) | → | cons(mark(X1),X2) | (15) |
a__fst(X1,X2) | → | fst(X1,X2) | (16) |
a__from(X) | → | from(X) | (17) |
a__add(X1,X2) | → | add(X1,X2) | (18) |
a__len(X) | → | len(X) | (19) |
mark#(from(X)) | → | a__from#(mark(X)) | (20) |
mark#(add(X1,X2)) | → | a__add#(mark(X1),mark(X2)) | (21) |
mark#(cons(X1,X2)) | → | mark#(X1) | (22) |
a__from#(X) | → | mark#(X) | (23) |
mark#(fst(X1,X2)) | → | mark#(X1) | (24) |
mark#(fst(X1,X2)) | → | mark#(X2) | (25) |
a__add#(0,X) | → | mark#(X) | (26) |
mark#(add(X1,X2)) | → | mark#(X1) | (27) |
mark#(fst(X1,X2)) | → | a__fst#(mark(X1),mark(X2)) | (28) |
mark#(len(X)) | → | mark#(X) | (29) |
mark#(from(X)) | → | mark#(X) | (30) |
a__fst#(s(X),cons(Y,Z)) | → | mark#(Y) | (31) |
mark#(add(X1,X2)) | → | mark#(X2) | (32) |
mark#(len(X)) | → | a__len#(mark(X)) | (33) |
The dependency pairs are split into 1 component.
a__add#(0,X) | → | mark#(X) | (26) |
mark#(fst(X1,X2)) | → | mark#(X2) | (25) |
mark#(add(X1,X2)) | → | mark#(X2) | (32) |
a__fst#(s(X),cons(Y,Z)) | → | mark#(Y) | (31) |
mark#(from(X)) | → | mark#(X) | (30) |
mark#(fst(X1,X2)) | → | mark#(X1) | (24) |
a__from#(X) | → | mark#(X) | (23) |
mark#(cons(X1,X2)) | → | mark#(X1) | (22) |
mark#(add(X1,X2)) | → | a__add#(mark(X1),mark(X2)) | (21) |
mark#(len(X)) | → | mark#(X) | (29) |
mark#(fst(X1,X2)) | → | a__fst#(mark(X1),mark(X2)) | (28) |
mark#(add(X1,X2)) | → | mark#(X1) | (27) |
mark#(from(X)) | → | a__from#(mark(X)) | (20) |
[a__len#(x1)] | = | 0 |
[s(x1)] | = | 1 |
[a__from#(x1)] | = | x1 + 1 |
[a__from(x1)] | = | x1 + 2 |
[a__add#(x1, x2)] | = | x2 + 1 |
[fst(x1, x2)] | = | x1 + x2 + 1 |
[a__add(x1, x2)] | = | x1 + x2 + 11799 |
[a__fst(x1, x2)] | = | x1 + x2 + 1 |
[mark#(x1)] | = | x1 + 0 |
[0] | = | 7183 |
[from(x1)] | = | x1 + 2 |
[nil] | = | 3267 |
[mark(x1)] | = | x1 + 0 |
[a__len(x1)] | = | x1 + 8366 |
[cons(x1, x2)] | = | x1 + 1 |
[add(x1, x2)] | = | x1 + x2 + 11799 |
[a__fst#(x1, x2)] | = | x2 + 0 |
[len(x1)] | = | x1 + 8366 |
a__add(X1,X2) | → | add(X1,X2) | (18) |
a__add(0,X) | → | mark(X) | (4) |
mark(cons(X1,X2)) | → | cons(mark(X1),X2) | (15) |
mark(fst(X1,X2)) | → | a__fst(mark(X1),mark(X2)) | (8) |
a__fst(0,Z) | → | nil | (1) |
a__from(X) | → | cons(mark(X),from(s(X))) | (3) |
a__fst(X1,X2) | → | fst(X1,X2) | (16) |
a__len(X) | → | len(X) | (19) |
a__from(X) | → | from(X) | (17) |
a__add(s(X),Y) | → | s(add(X,Y)) | (5) |
mark(add(X1,X2)) | → | a__add(mark(X1),mark(X2)) | (10) |
a__len(cons(X,Z)) | → | s(len(Z)) | (7) |
mark(nil) | → | nil | (14) |
mark(0) | → | 0 | (12) |
mark(len(X)) | → | a__len(mark(X)) | (11) |
mark(from(X)) | → | a__from(mark(X)) | (9) |
mark(s(X)) | → | s(X) | (13) |
a__len(nil) | → | 0 | (6) |
a__fst(s(X),cons(Y,Z)) | → | cons(mark(Y),fst(X,Z)) | (2) |
a__add#(0,X) | → | mark#(X) | (26) |
mark#(fst(X1,X2)) | → | mark#(X2) | (25) |
mark#(add(X1,X2)) | → | mark#(X2) | (32) |
a__fst#(s(X),cons(Y,Z)) | → | mark#(Y) | (31) |
mark#(from(X)) | → | mark#(X) | (30) |
mark#(fst(X1,X2)) | → | mark#(X1) | (24) |
a__from#(X) | → | mark#(X) | (23) |
mark#(cons(X1,X2)) | → | mark#(X1) | (22) |
mark#(add(X1,X2)) | → | a__add#(mark(X1),mark(X2)) | (21) |
mark#(len(X)) | → | mark#(X) | (29) |
mark#(fst(X1,X2)) | → | a__fst#(mark(X1),mark(X2)) | (28) |
mark#(add(X1,X2)) | → | mark#(X1) | (27) |
mark#(from(X)) | → | a__from#(mark(X)) | (20) |
The dependency pairs are split into 0 components.