rules of logic for logical equivalence problem

126 Views Asked by At

Use rules of logic to prove that

$ (P \land $ Q) $\lor $ ($\neg P \land \neg Q)$

is not a tautology.

I don't understand the first step to get the process going on this problem. So if someone could show me what is the first step to proving it's not a tautology