(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
g → h
c → d
h → g
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:
[g, h]
c > d
Status:
g: []
h: []
c: []
d: []
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
c → d
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
g → h
h → g
Q is empty.