Termination w.r.t. Q of the given QTRS could be proven:

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

not(x) → xor(x, true)
or(x, y) → xor(and(x, y), xor(x, y))
implies(x, y) → xor(and(x, y), xor(x, true))
and(x, true) → x
and(x, false) → false
and(x, x) → x
xor(x, false) → x
xor(x, x) → false
and(xor(x, y), z) → xor(and(x, z), and(y, z))

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:

NOT(x) → XOR(x, true)
OR(x, y) → XOR(and(x, y), xor(x, y))
OR(x, y) → AND(x, y)
OR(x, y) → XOR(x, y)
IMPLIES(x, y) → XOR(and(x, y), xor(x, true))
IMPLIES(x, y) → AND(x, y)
IMPLIES(x, y) → XOR(x, true)
AND(xor(x, y), z) → XOR(and(x, z), and(y, z))
AND(xor(x, y), z) → AND(x, z)
AND(xor(x, y), z) → AND(y, z)

The TRS R consists of the following rules:

not(x) → xor(x, true)
or(x, y) → xor(and(x, y), xor(x, y))
implies(x, y) → xor(and(x, y), xor(x, true))
and(x, true) → x
and(x, false) → false
and(x, x) → x
xor(x, false) → x
xor(x, x) → false
and(xor(x, y), z) → xor(and(x, z), and(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 8 less nodes.

(4) Obligation:

Q DP problem:
The TRS P consists of the following rules:

AND(xor(x, y), z) → AND(y, z)
AND(xor(x, y), z) → AND(x, z)

The TRS R consists of the following rules:

not(x) → xor(x, true)
or(x, y) → xor(and(x, y), xor(x, y))
implies(x, y) → xor(and(x, y), xor(x, true))
and(x, true) → x
and(x, false) → false
and(x, x) → x
xor(x, false) → x
xor(x, x) → false
and(xor(x, y), z) → xor(and(x, z), and(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(5) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

AND(xor(x, y), z) → AND(y, z)
AND(xor(x, y), z) → AND(x, z)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
AND(x1, x2)  =  AND(x1)

Tags:
AND has tags [1,0]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Recursive path order with status [RPO].
Quasi-Precedence:

trivial

Status:

xor₂: multiset

The following usable rules [FROCOS05] were oriented: none

(6) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

not(x) → xor(x, true)
or(x, y) → xor(and(x, y), xor(x, y))
implies(x, y) → xor(and(x, y), xor(x, true))
and(x, true) → x
and(x, false) → false
and(x, x) → x
xor(x, false) → x
xor(x, x) → false
and(xor(x, y), z) → xor(and(x, z), and(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(7) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(8) TRUE