The rewrite relation of the following TRS is considered.
zeros | → | cons(0,n__zeros) | (1) |
tail(cons(X,XS)) | → | activate(XS) | (2) |
zeros | → | n__zeros | (3) |
activate(n__zeros) | → | zeros | (4) |
activate(X) | → | X | (5) |
activate#(n__zeros) | → | zeros# | (6) |
tail#(cons(X,XS)) | → | activate#(XS) | (7) |
The dependency pairs are split into 0 components.