(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) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(2) Obligation:
Q DP problem:
The TRS P consists of the following rules:
AND(not(not(x)), y, not(z)) → AND(y, band(x, z), x)
The TRS R consists of the following rules:
and(not(not(x)), y, not(z)) → and(y, band(x, z), x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(3) QDPOrderProof (EQUIVALENT transformation)
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
AND(not(not(x)), y, not(z)) → AND(y, band(x, z), x)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
AND(
x0,
x1,
x2,
x3) =
AND(
x1,
x2)
Tags:
AND has argument tags [1,0,1,0] and root tag 0
Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
AND(
x1,
x2,
x3) =
AND(
x1,
x3)
not(
x1) =
not
band(
x1,
x2) =
band
Lexicographic path order with status [LPO].
Quasi-Precedence:
AND2 > band
not > band
Status:
AND2: [2,1]
not: []
band: []
The following usable rules [FROCOS05] were oriented:
none
(4) Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:
and(not(not(x)), y, not(z)) → and(y, band(x, z), x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(5) PisEmptyProof (EQUIVALENT transformation)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
(6) TRUE