Translate the following inference to logic notation: For all x, if x_1 were a server, then x_1 is working. For all x, x_1 will go running or x_1 will not work. For all x, if x_1 goes running, then x_1 is a server. Therefore for all x, x_1 will work if and only if x_1 will go running.
forall x: P(x) -> Q(x). forall x: R(x) or ~Q(x). forall x: R(x) -> P(x). Therefore forall x: Q(x) <-> R(x).