Translate the following inference to logic notation: For all x, z_3 is not a soldier or z_3 is a poet. For all x, z_3 will write a letter. For all x, z_3 will sleep if and only if z_3 will go running. For all x, z_3 is a soldier or z_3 will sleep. For all x, z_3 will not go running. Therefore for all x, z_3 is a poet and z_3 will write a letter.
forall x: ~P(x) or Q(x). forall x: R(x). forall x: S(x) <-> T(x). forall x: P(x) or S(x). forall x: ~T(x). Therefore forall x: Q(x) and R(x).