YES

Problem:
 zeros() -> cons(0(),n__zeros())
 tail(cons(X,XS)) -> activate(XS)
 zeros() -> n__zeros()
 activate(n__zeros()) -> zeros()
 activate(X) -> X

Proof:
 DP Processor:
  DPs:
   tail#(cons(X,XS)) -> activate#(XS)
   activate#(n__zeros()) -> zeros#()
  TRS:
   zeros() -> cons(0(),n__zeros())
   tail(cons(X,XS)) -> activate(XS)
   zeros() -> n__zeros()
   activate(n__zeros()) -> zeros()
   activate(X) -> X
  TDG Processor:
   DPs:
    tail#(cons(X,XS)) -> activate#(XS)
    activate#(n__zeros()) -> zeros#()
   TRS:
    zeros() -> cons(0(),n__zeros())
    tail(cons(X,XS)) -> activate(XS)
    zeros() -> n__zeros()
    activate(n__zeros()) -> zeros()
    activate(X) -> X
   graph:
    tail#(cons(X,XS)) -> activate#(XS) -> activate#(n__zeros()) -> zeros#()
   CDG Processor:
    DPs:
     tail#(cons(X,XS)) -> activate#(XS)
     activate#(n__zeros()) -> zeros#()
    TRS:
     zeros() -> cons(0(),n__zeros())
     tail(cons(X,XS)) -> activate(XS)
     zeros() -> n__zeros()
     activate(n__zeros()) -> zeros()
     activate(X) -> X
    graph:
     
    Qed