Translate the following inference to logic notation: For all x, if x_13 cooks, then x_13 is not rich. There is at least one x for which x_13 is a server if and only if x_13 is rich. For all x, x_13 is a server. Therefore there is at least one x for which x_13 will not cook.
forall x: P(x) -> ~Q(x). exists x: R(x) <-> Q(x). forall x: R(x). Therefore exists x: ~P(x).