Translate the following inference to logic notation: For all x, x_12 will sleep. For all x, if x_12 drives a car, then x_12 is not sleeping. William is driving a car if and only if James is working. Therefore James is not working.
forall x: P(x). forall x: Q(x) -> ~P(x). Q(a) <-> p. Therefore ~p.