Translate the following inference to logic notation: There is at least one x for which if z_2 were a mechanic, then z_2 is making tea. For all x, if z_2 cooks, then z_2 is a mechanic. For all x, z_2 will not make tea. For all x, if z_2 makes tea, then z_2 is a mechanic. Therefore there is at least one x for which z_2 will not cook.
exists x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: ~Q(x). forall x: Q(x) -> P(x). Therefore exists x: ~R(x).