Translate the following inference to logic notation: For all x, if x_8 were a lawyer, then x_8 is running. There is at least one x for which x_8 will not go running. For all x, if x_8 goes running, then x_8 is a lawyer. For all x, x_8 is a lawyer or x_8 will not go running. Therefore there is at least one x for which x_8 is not a lawyer.
forall x: P(x) -> Q(x). exists x: ~Q(x). forall x: Q(x) -> P(x). forall x: P(x) or ~Q(x). Therefore exists x: ~P(x).