(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
.(1, x) → x
.(x, 1) → x
.(i(x), x) → 1
.(x, i(x)) → 1
i(1) → 1
i(i(x)) → x
.(i(y), .(y, z)) → z
.(y, .(i(y), z)) → z
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Polynomial interpretation [POLO]:
POL(.(x1, x2)) = 2 + 2·x1 + 2·x2
POL(1) = 2
POL(i(x1)) = 2 + x1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
.(1, x) → x
.(x, 1) → x
.(i(x), x) → 1
.(x, i(x)) → 1
i(1) → 1
i(i(x)) → x
.(i(y), .(y, z)) → z
.(y, .(i(y), z)) → z
(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) YES