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