Translate the following inference to logic notation: For all x, x_13 will play tennis or x_13 is an artist. For all x, if x_13 plays tennis, then x_13 is working. For all x, x_13 will not work. For all x, if x_13 works, then x_13 is playing tennis. Therefore for all x, x_13 is an artist or x_13 will drive a car.
forall x: P(x) or Q(x). forall x: P(x) -> R(x). forall x: ~R(x). forall x: R(x) -> P(x). Therefore forall x: Q(x) or S(x).