The rewrite relation of the following TRS is considered.
terms(N) | → | cons(recip(sqr(N))) | (1) |
sqr(0) | → | 0 | (2) |
sqr(s) | → | s | (3) |
dbl(0) | → | 0 | (4) |
dbl(s) | → | s | (5) |
add(0,X) | → | X | (6) |
add(s,Y) | → | s | (7) |
first(0,X) | → | nil | (8) |
first(s,cons(Y)) | → | cons(Y) | (9) |
terms#(N) | → | sqr#(N) | (10) |
The dependency pairs are split into 0 components.