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()
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [h#](x0, x1, x2, x3) = 2x2 + 6,
    
    [p#](x0, x1) = 0,
    
    [g#](x0, x1) = 0,
    
    [f#](x0, x1) = 5x1 + 4,
    
    [bot] = 0,
    
    [h](x0, x1, x2, x3) = 3x2 + 5x3 + 3,
    
    [p](x0, x1) = 1,
    
    [s](x0) = 5x0 + 4,
    
    [g](x0, x1) = 0,
    
    [f](x0, x1) = 5x1,
    
    [0] = 0
   orientation:
    f#(0(),n) = 5n + 4 >= 0 = g#(0(),n)
    
    f#(m,0()) = 4 >= 0 = g#(m,0())
    
    f#(s(m),s(n)) = 25n + 24 >= 5n + 4 = f#(s(m),n)
    
    f#(s(m),s(n)) = 25n + 24 >= 0 = p#(m,n)
    
    f#(s(m),s(n)) = 25n + 24 >= 9 = f#(m,p(m,n))
    
    f#(s(m),s(n)) = 25n + 24 >= 16 = h#(m,n,f(m,p(m,n)),f(s(m),n))
    
    f(0(),n) = 5n >= 0 = g(0(),n)
    
    f(m,0()) = 0 >= 0 = g(m,0())
    
    f(s(m),s(n)) = 25n + 20 >= 25n + 18 = h(m,n,f(m,p(m,n)),f(s(m),n))
    
    g(n,m) = 0 >= 0 = bot()
    
    p(m,n) = 1 >= 0 = bot()
    
    h(k,l,m,n) = 3m + 5n + 3 >= 0 = bot()
   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