Translate the following inference to logic notation: For all x, x_15 is not an electrician. For all x, x_15 is not a lawyer. There is at least one x for which x_15 is a lawyer or x_15 will play tennis. For all x, x_15 is excited or x_15 is an electrician. For all x, x_15 is not excited or x_15 is a nurse. Therefore there is at least one x for which x_15 is a nurse and x_15 will play tennis.
forall x: ~P(x). forall x: ~Q(x). exists x: Q(x) or R(x). forall x: S(x) or P(x). forall x: ~S(x) or T(x). Therefore exists x: T(x) and R(x).