YES
O(n)
TRS:
 {
         .(x, 1()) -> x,
        .(x, i(x)) -> 1(),
  .(y, .(i(y), z)) -> z,
         .(1(), x) -> x,
        .(i(x), x) -> 1(),
  .(i(y), .(y, z)) -> z,
            i(1()) -> 1(),
           i(i(x)) -> x
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
           .(x, 1()) -> x,
          .(x, i(x)) -> 1(),
    .(y, .(i(y), z)) -> z,
           .(1(), x) -> x,
          .(i(x), x) -> 1(),
    .(i(y), .(y, z)) -> z,
              i(1()) -> 1(),
             i(i(x)) -> x
   }
  BOUND:
   Automaton:
    {   i_0(3) -> 3,
         1_1() -> 3,
         1_0() -> 3,
     ._0(3, 3) -> 3}
   Strict:
    {}
   Qed