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