YES

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

Consider the left-linear TRS R:

  a(c(x)) -> b(a(x))
  a(c(x)) -> a(c(x))
  a(a(x)) -> a(b(x))
  b(b(x)) -> a(c(x))
  c(c(x)) -> c(a(x))
  c(b(x)) -> a(c(x))
  a(b(x)) -> a(c(x))
  a(c(x)) -> a(c(x))

Let C be the following subset of R:

  (empty)

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

  phi(a(c(x)) -> b(a(x))) = 4
  phi(a(c(x)) -> a(c(x))) = 1
  phi(a(a(x)) -> a(b(x))) = 3
  phi(b(b(x)) -> a(c(x))) = 7
  phi(c(c(x)) -> c(a(x))) = 9
  phi(c(b(x)) -> a(c(x))) = 10
  phi(a(b(x)) -> a(c(x))) = 1
  phi(a(c(x)) -> a(c(x))) = 0

  psi(a(c(x)) -> b(a(x))) = 6
  psi(a(c(x)) -> a(c(x))) = 1
  psi(a(a(x)) -> a(b(x))) = 8
  psi(b(b(x)) -> a(c(x))) = 11
  psi(c(c(x)) -> c(a(x))) = 2
  psi(c(b(x)) -> a(c(x))) = 5
  psi(a(b(x)) -> a(c(x))) = 6
  psi(a(c(x)) -> a(c(x))) = 0


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.