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:

g(f(x, y), z) → f(x, g(y, z))
g(h(x, y), z) → g(x, f(y, z))
g(x, h(y, z)) → h(g(x, y), z)

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Recursive path order with status [RPO].
Quasi-Precedence:

g₂ > [f₂, h₂]

Status:

g₂: [1,2]
f₂: [2,1]
h₂: multiset

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

g(f(x, y), z) → f(x, g(y, z))
g(h(x, y), z) → g(x, f(y, z))
g(x, h(y, z)) → h(g(x, y), z)

(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