Which of the following statements is TRUE about the propositional logic formula
\(S: (p \to q) \wedge (\neg q \vee r) \wedge (r \to s) \to \neg (p \to s)\)
(A) S is a contradiction
(B) S is satisfiable but not valid
(C) S is valid
(D) None of the above
Formula is not valid at, p = False, q = True, s = True.