YES
(VAR y z x)
(RULES 
f(cons(nil,y)) -> y
f(cons(f(cons(nil,y)),z)) -> copy(n,y,z)
copy(0,y,z) -> f(z)
copy(s(x),y,z) -> copy(x,y,cons(f(y),z))
)

Proving termination of rewriting for hydra:

-> Dependency pairs:
nF_f(cons(f(cons(nil,y)),z)) -> nF_copy(n,y,z)
nF_copy(0,y,z) -> nF_f(z)
nF_copy(s(x),y,z) -> nF_copy(x,y,cons(f(y),z))
nF_copy(s(x),y,z) -> nF_f(y)

-> Proof of termination for hydra_1:
-> -> Dependency pairs in cycle:
nF_copy(s(x),y,z) -> nF_copy(x,y,cons(f(y),z))

Termination proved: Cycles verify subterm criterion.

SETTINGS:
Base ordering: Polynomial ordering
Proof mode: SCCs in DG + base ordering
Upper bound for coeffs: 1
Rationals below 1 for all non-replacing args: No
Polynomial interpretation: Linear
Coeffs in polynomials: No rationals
Delta: automatic



Termination was proved succesfully.