Translate the following inference to logic notation: For all x, x_11 will drink water or x_11 will not drive a car. For all x, x_11 will not listen to a song. There is at least one x for which x_11 will drive a car or x_11 will make tea. For all x, x_11 will listen to a song if and only if x_11 will drink water. Therefore there is at least one x for which x_11 will make tea.
forall x: P(x) or ~Q(x). forall x: ~R(x). exists x: Q(x) or S(x). forall x: R(x) <-> P(x). Therefore exists x: S(x).