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