YES
O(n^5)
TRS:
 {   f(0()) -> cons(0()),
  f(s(0())) -> f(p(s(0()))),
  p(s(0())) -> 0()}
 DUP: We consider a non-duplicating system.
  Trs:
   {   f(0()) -> cons(0()),
    f(s(0())) -> f(p(s(0()))),
    p(s(0())) -> 0()}
  Matrix Interpretation:
   Interpretation class: triangular
       [X4]    [1 1 0 0 0][X4]   [0]
       [X3]    [0 0 0 0 0][X3]   [0]
   [s]([X2]) = [0 0 0 0 0][X2] + [0]
       [X1]    [0 0 0 0 0][X1]   [1]
       [X0]    [0 0 0 0 0][X0]   [0]
   
       [X4]    [1 0 0 0 0][X4]   [0]
       [X3]    [0 0 0 0 0][X3]   [1]
   [p]([X2]) = [0 0 0 0 0][X2] + [0]
       [X1]    [0 0 0 0 0][X1]   [0]
       [X0]    [0 0 0 0 0][X0]   [0]
   
       [X4]    [1 0 0 1 0][X4]   [1]
       [X3]    [0 0 0 1 0][X3]   [0]
   [f]([X2]) = [0 0 0 0 0][X2] + [0]
       [X1]    [0 0 0 0 0][X1]   [0]
       [X0]    [0 0 0 0 0][X0]   [0]
   
         [1]
         [1]
   [0] = [0]
         [0]
         [0]
   
          [X4]    [1 0 0 0 0][X4]   [0]
          [X3]    [0 0 0 0 0][X3]   [0]
   [cons]([X2]) = [0 0 0 0 0][X2] + [0]
          [X1]    [0 0 0 0 0][X1]   [0]
          [X0]    [0 0 0 0 0][X0]   [0]
   
   
   Qed