Translate the following inference to logic notation: For all x, if x_14 cooks, then x_14 is working. Michael is happy or James is cooking. Michael is not happy. Therefore James is working.
forall x: P(x) -> Q(x). p or P(a). ~p. Therefore Q(a).