Translate the following inference to logic notation: If John works, then James is not an office clerk. For all x, x_14 is an office clerk. For all x, x_14 is happy. Therefore John is not working.
p -> ~P(a). forall x: P(x). forall x: Q(x). Therefore ~p.