YES

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

Consider the left-linear TRS R:

  f(g(x)) -> h(g(x),g(x))
  f(s(x)) -> h(s(x),s(x))
  g(x) -> s(x)

Let C be the following subset of R:

  (empty)

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

  f(g(y0)) -> f(s(y0))
  f(g(y0)) -> h(g(y0),g(y0))

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.