Translate the following inference to logic notation: There is at least one x for which if x_7 were a carpenter, then x_7 is excited. For all x, if x_7 were a server, then x_7 is an astronaut. For all x, if x_7 were excited, then x_7 is playing tennis. For all x, if x_7 were an astronaut, then x_7 is a carpenter. Therefore there is at least one x for which if x_7 were a server, then x_7 is playing tennis.
exists x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: Q(x) -> T(x). forall x: S(x) -> P(x). Therefore exists x: R(x) -> T(x).