Translate the following inference to logic notation: For all x, x_9 will make tea if and only if x_9 is a taxi driver. For all x, x_9 is not a taxi driver. For all x, if x_9 makes tea, then x_9 is a poet. For all x, if x_9 were curious, then x_9 is a poet. For all x, if x_9 were a poet, then x_9 is making tea. Therefore for all x, x_9 is not curious.
forall x: P(x) <-> Q(x). forall x: ~Q(x). forall x: P(x) -> R(x). forall x: S(x) -> R(x). forall x: R(x) -> P(x). Therefore forall x: ~S(x).