The rewrite relation of the following TRS is considered.
2nd(cons(X,n__cons(Y,Z))) | → | activate(Y) | (1) |
from(X) | → | cons(X,n__from(s(X))) | (2) |
cons(X1,X2) | → | n__cons(X1,X2) | (3) |
from(X) | → | n__from(X) | (4) |
activate(n__cons(X1,X2)) | → | cons(X1,X2) | (5) |
activate(n__from(X)) | → | from(X) | (6) |
activate(X) | → | X | (7) |
activate#(n__from(X)) | → | from#(X) | (8) |
activate#(n__cons(X1,X2)) | → | cons#(X1,X2) | (9) |
from#(X) | → | cons#(X,n__from(s(X))) | (10) |
2nd#(cons(X,n__cons(Y,Z))) | → | activate#(Y) | (11) |
The dependency pairs are split into 0 components.