YES

# Compositional parallel rule labeling (Shintani and Hirokawa 2022).

Consider the left-linear TRS R:

  f(x) -> g(k(x))
  f(x) -> a()
  g(x) -> a()
  k(a()) -> k(k(a()))

Let C be the following subset of R:

  (empty)

All parallel critical peaks (except C's) are decreasing wrt rule labeling:

  phi(f(x) -> g(k(x))) = 2
  phi(f(x) -> a()) = 2
  phi(g(x) -> a()) = 1
  phi(k(a()) -> k(k(a()))) = 1

  psi(f(x) -> g(k(x))) = 2
  psi(f(x) -> a()) = 2
  psi(g(x) -> a()) = 1
  psi(k(a()) -> k(k(a()))) = 1


Therefore, the confluence of R follows from that of C.

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

Consider the left-linear TRS R:

  (empty)

Let C be the following subset of R:

  (empty)

The parallel critical pair system PCPS(R,C) is:

  (empty)

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.