YES
O(n)
TRS:
 {f(c(X, s(Y))) -> f(c(s(X), Y)),
  g(c(s(X), Y)) -> f(c(X, s(Y)))}
 DUP: We consider a non-duplicating system.
  Trs:
   {f(c(X, s(Y))) -> f(c(s(X), Y)),
    g(c(s(X), Y)) -> f(c(X, s(Y)))}
  BOUND:
   Automaton:
    {
         g_0(3) -> 3,
         g_0(2) -> 3,
         g_0(1) -> 3,
         g_0(0) -> 3,
        s_2(14) -> 14,
         s_2(3) -> 14,
         s_2(2) -> 14,
         s_2(1) -> 14,
         s_2(0) -> 14,
        s_1(18) -> 18,
        s_1(14) -> 18,
         s_1(7) -> 7,
         s_1(3) -> 7,
         s_1(2) -> 7,
         s_1(1) -> 7,
         s_1(0) -> 7,
         s_0(3) -> 2,
         s_0(2) -> 2,
         s_0(1) -> 2,
         s_0(0) -> 2,
     c_2(14, 7) -> 15,
     c_2(14, 3) -> 15,
     c_2(14, 2) -> 15,
     c_2(14, 1) -> 15,
     c_2(14, 0) -> 15,
     c_1(18, 3) -> 8,
     c_1(18, 2) -> 8,
     c_1(18, 1) -> 8,
     c_1(18, 0) -> 8,
      c_1(7, 3) -> 11,
      c_1(7, 2) -> 11,
      c_1(7, 1) -> 11,
      c_1(7, 0) -> 11,
      c_1(3, 7) -> 8,
      c_1(2, 7) -> 8,
      c_1(1, 7) -> 8,
      c_1(0, 7) -> 8,
      c_0(3, 3) -> 1,
      c_0(3, 2) -> 1,
      c_0(3, 1) -> 1,
      c_0(3, 0) -> 1,
      c_0(2, 3) -> 1,
      c_0(2, 2) -> 1,
      c_0(2, 1) -> 1,
      c_0(2, 0) -> 1,
      c_0(1, 3) -> 1,
      c_0(1, 2) -> 1,
      c_0(1, 1) -> 1,
      c_0(1, 0) -> 1,
      c_0(0, 3) -> 1,
      c_0(0, 2) -> 1,
      c_0(0, 1) -> 1,
      c_0(0, 0) -> 1,
        f_2(15) -> 3,
        f_1(11) -> 0,
         f_1(8) -> 3,
         f_0(3) -> 0,
         f_0(2) -> 0,
         f_0(1) -> 0,
         f_0(0) -> 0
    }
   Strict:
    {}
   Qed