Translate the following inference to logic notation: For all x, x will take a plane or x will make tea. For all x, x will take a plane if and only if x is a taxi driver. There is at least one x for which x will sleep. For all x, x is not a taxi driver. Therefore there is at least one x for which x will sleep and x will make tea.
forall x: P(x) or Q(x). forall x: P(x) <-> R(x). exists x: S(x). forall x: ~R(x). Therefore exists x: S(x) and Q(x).