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