(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(h(x)) → f(i(x))
f(i(x)) → a
i(x) → h(x)
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Recursive Path Order [RPO].
Precedence:
f1 > [h1, i1, a]
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
f(i(x)) → a
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(h(x)) → f(i(x))
i(x) → h(x)
Q is empty.