Translate the following inference to logic notation: For all x, if x_12 makes tea, then x_12 is curious. If Sarah were a nurse, then Susan is curious. Sarah is not a nurse. If Susan were curious, then Sarah is a nurse. Therefore Susan is not making tea.
forall x: P(x) -> Q(x). p -> Q(a). ~p. Q(a) -> p. Therefore ~P(a).