YES
O(n)
TRS:
 {
    p(m, n, s(r)) -> p(m, r, n),
  p(m, s(n), 0()) -> p(0(), n, m),
   p(m, 0(), 0()) -> m
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
      p(m, n, s(r)) -> p(m, r, n),
    p(m, s(n), 0()) -> p(0(), n, m),
     p(m, 0(), 0()) -> m
   }
  BOUND:
   Automaton:
    {
            0_1() -> 3,
            0_0() -> 3,
           s_0(4) -> 4,
           s_0(3) -> 4,
     p_1(3, 3, 3) -> 3,
     p_0(4, 4, 4) -> 3,
     p_0(4, 4, 3) -> 3,
     p_0(4, 3, 4) -> 3,
     p_0(4, 3, 3) -> 3,
     p_0(3, 4, 4) -> 3,
     p_0(3, 4, 3) -> 3,
     p_0(3, 3, 4) -> 3,
     p_0(3, 3, 3) -> 3,
                4 -> 3
    }
   Strict:
    {}
   Qed