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