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