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