Translate the following inference to logic notation: For all x, x_13 will play squash if and only if x_13 is curious. There is at least one x for which x_13 is curious. For all x, x_13 will drive a car. Therefore there is at least one x for which x_13 will play squash and x_13 will drive a car.
forall x: P(x) <-> Q(x). exists x: Q(x). forall x: R(x). Therefore exists x: P(x) and R(x).