Translate the following inference to logic notation: For all x, if x_8 were a scientist, then x_8 is running. There is at least one x for which x_8 will go running if and only if x_8 is a server. For all x, if x_8 were a server, then x_8 is a scientist. Therefore there is at least one x for which if x_8 goes running, then x_8 is a server.
forall x: P(x) -> Q(x). exists x: Q(x) <-> R(x). forall x: R(x) -> P(x). Therefore exists x: Q(x) -> R(x).