(0) Obligation:

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

g(b) → f(b)
f(a) → g(a)
ba

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Recursive Path Order [RPO].
Precedence:
[g1, b, f1] > a

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

ba


(2) Obligation:

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

g(b) → f(b)
f(a) → g(a)

Q is empty.