We need the negation of p∧(q∧∼(p∧q)).
First, we simplify the inner part: q∧∼(p∧q)=q∧(∼p∨∼q). Distributing gives =(q∧∼p)∨(q∧∼q)=(q∧∼p)∨F=q∧∼p. Substituting back into the full expression yields p∧(q∧∼p)=(p∧∼p)∧q=F∧q=F.
Because the expression is always false, its negation is always true.
To find a matching tautology, consider Option 1: (∼(p∧q))∨p. This simplifies as follows: (∼(p∧q))∨p=(∼p∨∼q)∨p=(∼p∨p)∨∼q=T∨∼q=T, showing it is a tautology.
The correct answer is Option 1: (∼(p∧q))∨p.