Translate the following inference to logic notation: There is at least one x for which if x were a mechanic, then x is a sailor. For all x, if x were a sailor, then x is curious. For all x, if x were curious, then x is a mechanic. Therefore there is at least one x for which if x were curious, then x is a mechanic.
exists x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> P(x). Therefore exists x: R(x) -> P(x).