(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, a) → x
f(x, g(y)) → f(g(x), y)
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:
f2 > g1
a > g1
Status:
a: []
f2: [2,1]
g1: [1]
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
f(x, a) → x
f(x, g(y)) → f(g(x), y)
(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