Translate the following inference to logic notation: For all x, x_10 is a janitor or x_10 will not make tea. For all x, x_10 is a janitor if and only if x_10 will play squash. For all x, x_10 will make tea or x_10 will play squash. Therefore for all x, x_10 is a janitor or x_10 is a writer.
forall x: P(x) or ~Q(x). forall x: P(x) <-> R(x). forall x: Q(x) or R(x). Therefore forall x: P(x) or S(x).