Translate the following inference to logic notation: For all x, x_12 will drive a car and x_12 will make tea. There is at least one x for which if x_12 drives a car, then x_12 is sleeping. Therefore there is at least one x for which x_12 will sleep or x_12 will take a plane.
forall x: P(x) and Q(x). exists x: P(x) -> R(x). Therefore exists x: R(x) or S(x).