We need to determine which of the statements S1 and S2 are true.
To analyze S1, observe that (p⇒q)∧(p∧(∼q)) is claimed to be a contradiction.
Recall that p⇒q≡(∼p)∨q. Thus:
S1=((∼p)∨q)∧(p∧(∼q))
=((∼p)∨q)∧p∧(∼q)
Distributing yields:
=((∼p)∧p∧(∼q))∨(q∧p∧(∼q))
Since (∼p)∧p=F and q∧(∼q)=F, it follows that:
S1=F∨F=F
Thus, S1 is always false, so it is a contradiction and the claim in S1 is true.
Next, consider S2, whose expression (p∧q)∨((∼p)∧q)∨(p∧(∼q))∨((∼p)∧(∼q)) is to be shown a tautology.
We can factor this expression as:
=q∧(p∨(∼p))∨(∼q)∧(p∨(∼p))
Since p∨(∼p)=T, we obtain:
=(q∧T)∨((∼q)∧T)=q∨(∼q)=T
Hence, S2 is always true, i.e., it is a tautology, and the claim in S2 is true.
Since both S1 and S2 are true, the correct answer is Option D: both are true.