Translate the following inference to logic notation: If Thomas drives a car, then it is late. For all x, if x_17 sleeps, then x_17 is running. If William goes running, then Thomas is driving a car. If it is late, then William is sleeping. William is not running. Therefore William is not sleeping.
p -> q. forall x: P(x) -> Q(x). Q(a) -> p. q -> P(a). ~Q(a). Therefore ~P(a).