YES

# parallel critical pair closing system (Shintani and Hirokawa 2022, Section 8 in LMCS 2023)

Consider the left-linear TRS R:

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

Let C be the following subset of R:

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

The TRS R is left-linear and all parallel critical pairs are joinable by C.
Therefore, the confluence of R is equivalent to that of C.

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

Consider the left-linear TRS R:

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

Let C be the following subset of R:

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

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.

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

Consider the left-linear TRS R:

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

Let C be the following subset of R:

  (empty)

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

  a(b(c(x1_1))) -> a(a(c(x1_1)))
  a(b(c(x1_1))) -> a(c(c(x1_1)))
  c(c(c(x1_1))) -> c(c(b(x1_1)))
  c(c(c(x1_1))) -> c(b(c(x1_1)))
  a(c(c(x1_1))) -> a(c(b(x1_1)))
  a(c(c(x1_1))) -> c(b(c(x1_1)))
  b(c(c(x1_1))) -> b(c(b(x1_1)))
  b(c(c(x1_1))) -> a(c(c(x1_1)))

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.