(0) Obligation:

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

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

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Recursive path order with status [RPO].
Quasi-Precedence:
[f2, g2] > h1

Status:
g2: multiset
f2: multiset
h1: multiset

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

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


(2) Obligation:

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

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

Q is empty.

(3) QTRSRRRProof (EQUIVALENT transformation)

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

Status:
g2: multiset
f2: [2,1]

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

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


(4) Obligation:

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

(5) RisEmptyProof (EQUIVALENT transformation)

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

(6) TRUE