Consider the following SAT boolean formula:
¬(x1 ∧ x2) ∨ x4) ↔ (x3 ∧ x1)
Can anyone explain to me how to reduce it to a 3-SAT-CNF boolean for
