YES
O(n)
TRS:
 {f() -> g(),
  c() -> f()}
 DUP: We consider a non-duplicating system.
  Trs:
   {f() -> g(),
    c() -> f()}
  BOUND:
   Automaton:
    {
     g_2() -> 8,
     g_1() -> 6,
     g_0() -> 3,
     c_0() -> 3,
     f_1() -> 4,
     f_0() -> 3,
         8 -> 4,
         6 -> 3,
         4 -> 3
    }
   Strict:
    {}
   Qed