Translate the following inference to logic notation: There is at least one x for which x_11 will sleep or x_11 is not a bartender. For all x, if x_11 sleeps, then x_11 is a taxi driver. For all x, x_11 will drink water or x_11 is not a taxi driver. Therefore there is at least one x for which if x_11 were a bartender, then x_11 is drinking water.
exists x: P(x) or ~Q(x). forall x: P(x) -> R(x). forall x: S(x) or ~R(x). Therefore exists x: Q(x) -> S(x).