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