Translate the following inference to logic notation: For all x, x_4 will not work or x_4 is a server. For all x, x_4 will not go running or x_4 will work. For all x, x_4 will go running or x_4 is an office clerk. For all x, x_4 is not an office clerk or x_4 will play tennis. Therefore for all x, x_4 will play tennis or x_4 is a server.
forall x: ~P(x) or Q(x). forall x: ~R(x) or P(x). forall x: R(x) or S(x). forall x: ~S(x) or T(x). Therefore forall x: T(x) or Q(x).