Translate the following inference to logic notation: For all x, x_7 will not cook. For all x, x_7 is curious if and only if x_7 will cook. For all x, if x_7 were poor, then x_7 is curious. Therefore for all x, x_7 is not poor.
forall x: ~P(x). forall x: Q(x) <-> P(x). forall x: R(x) -> Q(x). Therefore forall x: ~R(x).