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