YES

# Compositional critical pair system (Shintani and Hirokawa 2022).

Consider the left-linear TRS R:

  a(s(x)) -> s(a(x))
  b(a(b(s(x)))) -> a(b(s(a(x))))
  b(a(b(b(x)))) -> a(b(a(b(x))))
  a(b(a(a(x)))) -> b(a(b(a(x))))

Let C be the following subset of R:

  (empty)

The critical pair system CPS(R,C) is:

  a(b(a(a(s(x0))))) -> a(b(a(s(a(x0)))))
  a(b(a(a(s(x0))))) -> b(a(b(a(s(x0)))))
  b(a(b(b(a(b(s(x0))))))) -> b(a(b(a(b(s(a(x0)))))))
  b(a(b(b(a(b(s(x0))))))) -> a(b(a(b(a(b(s(x0)))))))
  b(a(b(b(a(b(b(x0))))))) -> b(a(b(a(b(a(b(x0)))))))
  b(a(b(b(a(b(b(x0))))))) -> a(b(a(b(a(b(b(x0)))))))
  a(b(a(a(b(a(a(x0))))))) -> a(b(a(b(a(b(a(x0)))))))
  a(b(a(a(b(a(a(x0))))))) -> b(a(b(a(b(a(a(x0)))))))

All pairs in PCP(R) are joinable and PCPS(R,C)/R is terminating.
Therefore, the confluence of R follows from that of C.

# emptiness

The empty TRS is confluent.