Translate the following inference to logic notation: For all x, if x_5 were excited, then x_5 is working. For all x, if x_5 works, then x_5 is a taxi driver. There is at least one x for which x_5 will make tea. For all x, if x_5 writes a letter, then x_5 is a taxi driver. For all x, x_5 will write a letter or x_5 is excited. Therefore there is at least one x for which x_5 is a taxi driver and x_5 will make tea.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). exists x: S(x). forall x: T(x) -> R(x). forall x: T(x) or P(x). Therefore exists x: R(x) and S(x).