In order to test the validity of the argument (S1, S2 ; S), we first construct the truth table for the conditional statement.
S1 ∧ S2 → S i.e [(p ∨ q) ∧ ~p] → q
The truth table is as given below:
We observe that the last common of the truth table for S1 ∧ S2 → S contains T only. Thus, S1 ∧ S2 → S is a tautology.
Hence, the given argument is valid.