Translate the following inference to logic notation: There is at least one x for which if y were a soldier, then y is reading a book. For all x, if y were an office clerk, then y is a mechanic. For all x, if y reads a book, then y is a server. For all x, if y were a mechanic, then y is a soldier. Therefore there is at least one x for which if y were an office clerk, then y is a server.
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).