Translate the following inference to logic notation: There is at least one x for which x_6 is excited if and only if x_6 is a server. For all x, if x_6 were excited, then x_6 is fast. For all x, x_6 is not fast. Therefore there is at least one x for which x_6 is not a server.
exists x: P(x) <-> Q(x). forall x: P(x) -> R(x). forall x: ~R(x). Therefore exists x: ~Q(x).