YES

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

Consider the left-linear TRS R:

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

Let C be the following subset of R:

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

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 rule labeling (Shintani and Hirokawa 2022).

Consider the left-linear TRS R:

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

Let C be the following subset of R:

  (empty)

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

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

  psi(f(f(g(g(x)))) -> f(a())) = 4
  psi(g(a()) -> a()) = 4
  psi(f(a()) -> a()) = 2
  psi(f(f(f(x))) -> a()) = 5
  psi(f(f(a())) -> 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.