Translate the following inference to logic notation: For all x, y will go running or y is not a taxi driver. For all x, y will go running if and only if y is sad. For all x, y is sad or y is a taxi driver. Therefore for all x, y will go running.
forall x: P(x) or ~Q(x). forall x: P(x) <-> R(x). forall x: R(x) or Q(x). Therefore forall x: P(x).