YES

# parallel critical pair closing system (Shintani and Hirokawa 2022)

Consider the left-linear TRS R:

  g(a()) -> f(g(a()))
  g(b()) -> c(a())
  a() -> b()
  f(x) -> h(x)
  h(x) -> c(b())

Let C be the following subset of R:

  g(b()) -> c(a())
  a() -> b()
  f(x) -> h(x)
  h(x) -> c(b())

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

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

Consider the left-linear TRS R:

  g(b()) -> c(a())
  a() -> b()
  f(x) -> h(x)
  h(x) -> c(b())

Let C be the following subset of R:

  a() -> b()

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.

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

Consider the left-linear TRS R:

  a() -> b()

Let C be the following subset of R:

  (empty)

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.

# emptiness

The empty TRS is confluent.