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)
   EDG 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#(m,0()) -> g#(m,0())
     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#(s(m),s(n)) -> p#(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)) -> h#(m,n,f(m,p(m,n)),f(s(m),n))
     f#(s(m),s(n)) -> f#(m,p(m,n)) -> f#(0(),n) -> g#(0(),n)
    SCC Processor:
     #sccs: 1
     #rules: 1
     #arcs: 6/36
     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()
     KBO Processor:
      argument filtering:
       pi(0) = []
       pi(f) = [0,1]
       pi(g) = [1]
       pi(s) = [0]
       pi(p) = [0]
       pi(h) = [0,1]
       pi(bot) = []
       pi(f#) = 1
      weight function:
       w0 = 1
       w(f#) = w(bot) = w(h) = w(p) = w(s) = w(f) = w(0) = 1
       w(g) = 0
      precedence:
       f# > h ~ g ~ 0 > bot ~ p ~ s ~ f
      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