(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
(x, x) → e
/(x, x) → e
.(e, x) → x
.(x, e) → x
(e, x) → x
/(x, e) → x
.(x, (x, y)) → y
.(/(y, x), x) → y
(x, .(x, y)) → y
/(.(y, x), x) → y
/(x, (y, x)) → y
(/(x, y), x) → y
Q is empty.
(1) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(2) Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:
(x, x) → e
/(x, x) → e
.(e, x) → x
.(x, e) → x
(e, x) → x
/(x, e) → x
.(x, (x, y)) → y
.(/(y, x), x) → y
(x, .(x, y)) → y
/(.(y, x), x) → y
/(x, (y, x)) → y
(/(x, y), x) → y
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(3) PisEmptyProof (EQUIVALENT transformation)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
(4) TRUE