Translate the following inference to logic notation: For all x, z is not a mechanic. For all x, z will make tea or z is a mechanic. For all x, z will not make tea or z will take a plane. Therefore Richard is taking a plane.
forall x: ~P(x). forall x: Q(x) or P(x). forall x: ~Q(x) or R(x). Therefore R(a).