YES

Problem:
 f(0()) -> cons(0())
 f(s(0())) -> f(p(s(0())))
 p(s(X)) -> X

Proof:
 DP Processor:
  DPs:
   f#(s(0())) -> p#(s(0()))
   f#(s(0())) -> f#(p(s(0())))
  TRS:
   f(0()) -> cons(0())
   f(s(0())) -> f(p(s(0())))
   p(s(X)) -> X
  TDG Processor:
   DPs:
    f#(s(0())) -> p#(s(0()))
    f#(s(0())) -> f#(p(s(0())))
   TRS:
    f(0()) -> cons(0())
    f(s(0())) -> f(p(s(0())))
    p(s(X)) -> X
   graph:
    f#(s(0())) -> f#(p(s(0()))) -> f#(s(0())) -> f#(p(s(0())))
    f#(s(0())) -> f#(p(s(0()))) -> f#(s(0())) -> p#(s(0()))
   CDG Processor:
    DPs:
     f#(s(0())) -> p#(s(0()))
     f#(s(0())) -> f#(p(s(0())))
    TRS:
     f(0()) -> cons(0())
     f(s(0())) -> f(p(s(0())))
     p(s(X)) -> X
    graph:
     
    Qed