Translate the following inference to logic notation: For all x, x_5 is excited or x_5 is a doctor. For all x, if x_5 were excited, then x_5 is a server. For all x, x_5 is a doctor if and only if x_5 will play tennis. For all x, if x_5 were a server, then x_5 is playing tennis. Therefore for all x, x_5 will play tennis.
forall x: P(x) or Q(x). forall x: P(x) -> R(x). forall x: Q(x) <-> S(x). forall x: R(x) -> S(x). Therefore forall x: S(x).