The rewrite relation of the following TRS is considered.
and(tt) | → | X | (1) |
length(cons(N)) | → | s(length(L)) | (2) |
zeros | → | cons(0) | (3) |
length(nil) | → | 0 | (4) |
take(0,IL) | → | nil | (5) |
take(s(M),cons(N)) | → | cons(N) | (6) |
t0 | = | and(tt) |
→ | and(tt) | |
= | t1 |