Translate the following inference to logic notation: There is at least one x for which if x_9 were a janitor, then x_9 is cooking. For all x, if x_9 were a server, then x_9 is a janitor. For all x, x_9 will not cook. For all x, if x_9 were a janitor, then x_9 is a server. Therefore there is at least one x for which x_9 is not a server.
exists x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: ~Q(x). forall x: P(x) -> R(x). Therefore exists x: ~R(x).