Translate the following inference to logic notation: For all x, x_11 will play a game if and only if x_11 will make tea. There is at least one x for which x_11 is a taxi driver. For all x, if x_11 were a taxi driver, then x_11 is driving a car. For all x, if x_11 plays a game, then x_11 is not driving a car. Therefore there is at least one x for which x_11 will not make tea.
forall x: P(x) <-> Q(x). exists x: R(x). forall x: R(x) -> S(x). forall x: P(x) -> ~S(x). Therefore exists x: ~Q(x).