Termination w.r.t. Q of the given QTRS could be proven:

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(g(x)) → g(g(f(x)))
f(g(x)) → g(g(g(x)))

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Recursive Path Order [RPO].
Precedence:

f₁ > g₁

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

f(g(x)) → g(g(f(x)))
f(g(x)) → g(g(g(x)))

(2) Obligation:

Q restricted rewrite system:
R is empty.
Q is empty.

(3) RisEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(4) TRUE