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