If F_1, F_2 and F_3 are propositional formulae such that F_1 and F_2 -> F_3 and F_1 and F_2 -> not F_3 are both tautologies, then which of the following is true: A. Both F_1 and F_2 are tautologies B. The conjunction F_1 and F_2 is not satisfiable C. Neither is tautologous D. Neither is satisfiable E. None of the above
GATE 1991 · Discrete Mathematics · Propositional Logic · medium
Answer: F1 and F2 must be unsatisfiable, so the correct option is B.
Suppose F1 and F2 is satisfiable: Let I be an assignment making F1 and F2 True. Since (F1 and F2) -> F3 is a tautology, F3 is True under I. Since (F1 and F2) -> not F3 is also a tautology, not F3 is True under I.
Reach a contradiction and conclude: Under I we would have both F3 = True and not F3 = True, which can never happen. So no assignment I makes F1 and F2 True; the conjunction F1 and F2 is not satisfiable.