YES

We show the termination of the TRS R:

  g(x,a(),b()) -> g(b(),b(),a())

-- SCC decomposition.

Consider the dependency pair problem (P, R), where P consists of

p1: g#(x,a(),b()) -> g#(b(),b(),a())

and R consists of:

r1: g(x,a(),b()) -> g(b(),b(),a())

The estimated dependency graph contains the following SCCs:

  (no SCCs)