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