Translate the following inference to logic notation: For all x, if x_12 goes running, then x_12 is sleeping. For all x, x_12 will sleep if and only if x_12 will go running. For all x, x_12 is a taxi driver or x_12 will not go running. For all x, x_12 is not a taxi driver. Therefore for all x, x_12 will not sleep.
forall x: P(x) -> Q(x). forall x: Q(x) <-> P(x). forall x: R(x) or ~P(x). forall x: ~R(x). Therefore forall x: ~Q(x).