Translate the following inference to logic notation: For all x, x_10 will drive a car or x_10 will not go running. For all x, x_10 will not play tennis. For all x, if x_10 drives a car, then x_10 is running. For all x, if x_10 goes running, then x_10 is playing tennis. Therefore for all x, x_10 will not drive a car.
forall x: P(x) or ~Q(x). forall x: ~R(x). forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). Therefore forall x: ~P(x).