The compound statement (∼(P∧Q))∨((∼P)∧Q)⇒((∼P)∧(∼Q))(\sim(P \wedge Q)) \vee ((\sim P) \wedge Q) \Rightarrow ((\sim P) \wedge (\sim Q))(∼(P∧Q))∨((∼P)∧Q)⇒((∼P)∧(∼Q)) is equivalent to
((∼P)∨Q)∧((∼Q)∨P)((\sim P) \vee Q) \wedge ((\sim Q) \vee P)((∼P)∨Q)∧((∼Q)∨P)
(∼Q)∨P(\sim Q) \vee P(∼Q)∨P
((∼P)∨Q)∧(∼Q)((\sim P) \vee Q) \wedge (\sim Q)((∼P)∨Q)∧(∼Q)
(∼P)∨Q(\sim P) \vee Q(∼P)∨Q
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.