Translate the following inference to logic notation: There is at least one x for which x_6 will cook or x_6 is a server. For all x, x_6 is a bartender. For all x, x_6 will not cook. Therefore there is at least one x for which x_6 is a bartender.
exists x: P(x) or Q(x). forall x: R(x). forall x: ~P(x). Therefore exists x: R(x).