Translate the following inference to logic notation: For all x, x_12 is poor. For all x, x_12 is not a server. For all x, x_12 is a writer if and only if x_12 is a server. For all x, x_12 is a writer or x_12 is a janitor. For all x, if x_12 were a janitor, then x_12 is a mechanic. Therefore for all x, x_12 is a mechanic and x_12 is poor.
forall x: P(x). forall x: ~Q(x). forall x: R(x) <-> Q(x). forall x: R(x) or S(x). forall x: S(x) -> T(x). Therefore forall x: T(x) and P(x).