Convert logic formula into CNF

Question

I'm trying to convert ¬(P∧ ¬R)∨(R∧Q) into conjunctive normal form by using logical rules, but I'm stuck. Can you help me?

Answer 1

I used DeMorgan's Law: $(¬P ∨ R)∨(R∧Q)$.

Okay, but $\vee$ is associative, so the bracketing of the first disjunct is optional.

Then I tried to rewrite ∨ using ¬ and ∧. For example $A ∨ B = ¬ (¬ A ∧ ¬ B)$. So, I got $¬(¬(¬P ∨ R) ∧ ¬(R ∧Q))$.

No. Go back a step and look again.

I used DeMorgan's Law: $\lnot P\lor \underbrace{R\lor (R\land Q)}$.