YES

Problem:
 h(X,Z) -> f(X,s(X),Z)
 f(X,Y,g(X,Y)) -> h(0(),g(X,Y))
 g(0(),Y) -> 0()
 g(X,s(Y)) -> g(X,Y)

Proof:
 DP Processor:
  DPs:
   h#(X,Z) -> f#(X,s(X),Z)
   f#(X,Y,g(X,Y)) -> h#(0(),g(X,Y))
   g#(X,s(Y)) -> g#(X,Y)
  TRS:
   h(X,Z) -> f(X,s(X),Z)
   f(X,Y,g(X,Y)) -> h(0(),g(X,Y))
   g(0(),Y) -> 0()
   g(X,s(Y)) -> g(X,Y)
  CDG Processor:
   DPs:
    h#(X,Z) -> f#(X,s(X),Z)
    f#(X,Y,g(X,Y)) -> h#(0(),g(X,Y))
    g#(X,s(Y)) -> g#(X,Y)
   TRS:
    h(X,Z) -> f(X,s(X),Z)
    f(X,Y,g(X,Y)) -> h(0(),g(X,Y))
    g(0(),Y) -> 0()
    g(X,s(Y)) -> g(X,Y)
   graph:
    f#(X,Y,g(X,Y)) -> h#(0(),g(X,Y)) -> h#(X,Z) -> f#(X,s(X),Z)
   SCC Processor:
    #sccs: 0
    #rules: 0
    #arcs: 1/9