YES

Problem:
 f(0(),n) -> g(0(),n)
 f(m,0()) -> g(m,0())
 f(s(m),s(n)) -> h(m,n,f(m,p(m,n)),f(s(m),n))
 g(n,m) -> bot()
 p(m,n) -> bot()
 h(k,l,m,n) -> bot()

Proof:
 DP Processor:
  DPs:
   f#(0(),n) -> g#(0(),n)
   f#(m,0()) -> g#(m,0())
   f#(s(m),s(n)) -> f#(s(m),n)
   f#(s(m),s(n)) -> p#(m,n)
   f#(s(m),s(n)) -> f#(m,p(m,n))
   f#(s(m),s(n)) -> h#(m,n,f(m,p(m,n)),f(s(m),n))
  TRS:
   f(0(),n) -> g(0(),n)
   f(m,0()) -> g(m,0())
   f(s(m),s(n)) -> h(m,n,f(m,p(m,n)),f(s(m),n))
   g(n,m) -> bot()
   p(m,n) -> bot()
   h(k,l,m,n) -> bot()
  TDG Processor:
   DPs:
    f#(0(),n) -> g#(0(),n)
    f#(m,0()) -> g#(m,0())
    f#(s(m),s(n)) -> f#(s(m),n)
    f#(s(m),s(n)) -> p#(m,n)
    f#(s(m),s(n)) -> f#(m,p(m,n))
    f#(s(m),s(n)) -> h#(m,n,f(m,p(m,n)),f(s(m),n))
   TRS:
    f(0(),n) -> g(0(),n)
    f(m,0()) -> g(m,0())
    f(s(m),s(n)) -> h(m,n,f(m,p(m,n)),f(s(m),n))
    g(n,m) -> bot()
    p(m,n) -> bot()
    h(k,l,m,n) -> bot()
   graph:
    f#(s(m),s(n)) -> f#(s(m),n) ->
    f#(s(m),s(n)) -> h#(m,n,f(m,p(m,n)),f(s(m),n))
    f#(s(m),s(n)) -> f#(s(m),n) -> f#(s(m),s(n)) -> f#(m,p(m,n))
    f#(s(m),s(n)) -> f#(s(m),n) -> f#(s(m),s(n)) -> p#(m,n)
    f#(s(m),s(n)) -> f#(s(m),n) -> f#(s(m),s(n)) -> f#(s(m),n)
    f#(s(m),s(n)) -> f#(s(m),n) -> f#(m,0()) -> g#(m,0())
    f#(s(m),s(n)) -> f#(s(m),n) -> f#(0(),n) -> g#(0(),n)
    f#(s(m),s(n)) -> f#(m,p(m,n)) ->
    f#(s(m),s(n)) -> h#(m,n,f(m,p(m,n)),f(s(m),n))
    f#(s(m),s(n)) -> f#(m,p(m,n)) -> f#(s(m),s(n)) -> f#(m,p(m,n))
    f#(s(m),s(n)) -> f#(m,p(m,n)) -> f#(s(m),s(n)) -> p#(m,n)
    f#(s(m),s(n)) -> f#(m,p(m,n)) -> f#(s(m),s(n)) -> f#(s(m),n)
    f#(s(m),s(n)) -> f#(m,p(m,n)) -> f#(m,0()) -> g#(m,0())
    f#(s(m),s(n)) -> f#(m,p(m,n)) -> f#(0(),n) -> g#(0(),n)
   SCC Processor:
    #sccs: 1
    #rules: 2
    #arcs: 12/36
    DPs:
     f#(s(m),s(n)) -> f#(s(m),n)
     f#(s(m),s(n)) -> f#(m,p(m,n))
    TRS:
     f(0(),n) -> g(0(),n)
     f(m,0()) -> g(m,0())
     f(s(m),s(n)) -> h(m,n,f(m,p(m,n)),f(s(m),n))
     g(n,m) -> bot()
     p(m,n) -> bot()
     h(k,l,m,n) -> bot()
    Subterm Criterion Processor:
     simple projection:
      pi(f#) = 0
     problem:
      DPs:
       f#(s(m),s(n)) -> f#(s(m),n)
      TRS:
       f(0(),n) -> g(0(),n)
       f(m,0()) -> g(m,0())
       f(s(m),s(n)) -> h(m,n,f(m,p(m,n)),f(s(m),n))
       g(n,m) -> bot()
       p(m,n) -> bot()
       h(k,l,m,n) -> bot()
     Subterm Criterion Processor:
      simple projection:
       pi(f#) = 1
      problem:
       DPs:
        
       TRS:
        f(0(),n) -> g(0(),n)
        f(m,0()) -> g(m,0())
        f(s(m),s(n)) -> h(m,n,f(m,p(m,n)),f(s(m),n))
        g(n,m) -> bot()
        p(m,n) -> bot()
        h(k,l,m,n) -> bot()
      Qed