Translate the following inference to logic notation: For all x, x_10 will go running or x_10 will not work. For all x, x_10 is a bartender or x_10 will play squash. For all x, x_10 will work or x_10 will not play squash. For all x, if x_10 were a bartender, then x_10 is working. Therefore for all x, x_10 will go running.
forall x: P(x) or ~Q(x). forall x: R(x) or S(x). forall x: Q(x) or ~S(x). forall x: R(x) -> Q(x). Therefore forall x: P(x).