The rewrite relation of the following TRS is considered.
a__zeros | → | cons(0,zeros) | (1) |
a__and(tt,X) | → | mark(X) | (2) |
a__length(nil) | → | 0 | (3) |
a__length(cons(N,L)) | → | s(a__length(mark(L))) | (4) |
a__take(0,IL) | → | nil | (5) |
a__take(s(M),cons(N,IL)) | → | cons(mark(N),take(M,IL)) | (6) |
mark(zeros) | → | a__zeros | (7) |
mark(and(X1,X2)) | → | a__and(mark(X1),X2) | (8) |
mark(length(X)) | → | a__length(mark(X)) | (9) |
mark(take(X1,X2)) | → | a__take(mark(X1),mark(X2)) | (10) |
mark(cons(X1,X2)) | → | cons(mark(X1),X2) | (11) |
mark(0) | → | 0 | (12) |
mark(tt) | → | tt | (13) |
mark(nil) | → | nil | (14) |
mark(s(X)) | → | s(mark(X)) | (15) |
a__zeros | → | zeros | (16) |
a__and(X1,X2) | → | and(X1,X2) | (17) |
a__length(X) | → | length(X) | (18) |
a__take(X1,X2) | → | take(X1,X2) | (19) |
t0 | = | a__length(cons(N,zeros)) |
→ | s(a__length(mark(zeros))) | |
→ | s(a__length(a__zeros)) | |
→ | s(a__length(cons(0,zeros))) | |
= | t3 |