YES
O(n)
TRS:
 {
        \(x, x) -> e(),
  \(x, .(x, y)) -> y,
      \(e(), x) -> x,
  \(/(x, y), x) -> y,
        /(x, x) -> e(),
      /(x, e()) -> x,
  /(x, \(y, x)) -> y,
  /(.(y, x), x) -> y,
      .(x, e()) -> x,
  .(x, \(x, y)) -> y,
      .(e(), x) -> x,
  .(/(y, x), x) -> y
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
          \(x, x) -> e(),
    \(x, .(x, y)) -> y,
        \(e(), x) -> x,
    \(/(x, y), x) -> y,
          /(x, x) -> e(),
        /(x, e()) -> x,
    /(x, \(y, x)) -> y,
    /(.(y, x), x) -> y,
        .(x, e()) -> x,
    .(x, \(x, y)) -> y,
        .(e(), x) -> x,
    .(/(y, x), x) -> y
   }
  BOUND:
   Automaton:
    {
     ._0(4, 4) -> 4,
     /_0(4, 4) -> 4,
     \_0(4, 4) -> 4,
         e_1() -> 4,
         e_0() -> 4
    }
   Strict:
    {}
   Qed