YES(?,O(n^1))
TRS:
 {f h x -> f i x,
  g i x -> g h x,
  h a() -> b(),
  i a() -> b()}
 DUP: We consider a non-duplicating system.
  Trs:
   {f h x -> f i x,
    g i x -> g h x,
    h a() -> b(),
    i a() -> b()}
  BOUND:
   Bound: match(-raise)-bounded by 1
   Automaton:
    {
        a_0() -> 2*
        b_1() -> 3*
        b_0() -> 1*
       i_1(7) -> 8*
       i_1(4) -> 5*
       i_0(2) -> 1*
       i_0(1) -> 1*
      h_1(12) -> 13*
       h_1(9) -> 10*
       h_0(2) -> 1*
       h_0(1) -> 1*
      g_1(10) -> 11*
       g_0(2) -> 1*
       g_0(1) -> 1*
       f_1(5) -> 6*
     f_0(2) -> 1*
     f_0(1) -> 1*
         13 -> 10*
         11 -> 1*
          8 -> 5*
          6 -> 1*
          3 -> 13 | 8 | 1
          2 -> 12 | 7
          1 -> 9 | 4
    }
   Strict:
    {}
   Qed