Translate the following inference to logic notation: For all x, if x_12 were curious, then x_12 is happy. If Karen were happy, then Karen is playing squash. Karen is not happy. If Karen plays squash, then Karen is curious. Therefore Karen is not playing squash.
forall x: P(x) -> Q(x). Q(a) -> p. ~Q(a). p -> P(a). Therefore ~p.