Among the statements
(S1): is a tautology
(S2): is a contradiction
We begin by determining which of the two statements is true.
First consider the expression and check whether it is a tautology. Recall that . Hence
since is absorbed by . Testing gives , so this expression is not always true and therefore S1 fails to be a tautology.
Next examine the expression to see if it is a contradiction. Noting that , we find
and testing yields . Since the expression can be true, S2 is not a contradiction.
For completeness, the following truth table verifies the values of S1 and S2 under all assignments of and :
| S1 expression | S2 expression | ||
| T | T | T | F |
| T | F | F | F |
| F | T | T | T |
| F | F | T | F |
Since S1 is not a tautology (it fails when ) and S2 is not a contradiction (it holds when ), neither statement is true.
The correct answer is Option A: Neither (S1) nor (S2) is True.
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.