Consider the following premises. t or ~U(c_2). forall z_2: U(z_2). Can we infer t from them? If possible, name the inference rules being used at each step.
 From forall z_2: U(z_2) we can infer U(c_2) via universal instantiation. From t or ~U(c_2) we can infer U(c_2) -> t via rewriting. Finally, from U(c_2) -> t, U(c_2) we can infer t via modus ponens. Therefore, the answer is yes.