I'm trying to convert these following Boolean expressions into a CNF: (1)P ∨ (¬Q ∧ (R → ¬P)) (2)¬((P → (Q → R))) → ((P → Q) → (Q → R))
I apply various laws until I get to: (1) P ∨ (¬(Q ∨ R) ∨ ¬(Q ∨ P)) (2) (P ∧ (Q ∧ ¬R)) ∧ ((¬P ∨ Q) ∧ (Q ∧ ¬R))
These doesn't fit the form of a CNF for sure, but I'm not sure how to get to that. If you could help please!