Consider the following premises. forall x: ~R(x). p_8 <-> u_3. u_3 -> R(i_4). Can we infer ~p_8 or q from them? If possible, name the inference rules being used at each step.
 From forall x: ~R(x) we can infer ~R(i_4) via universal instantiation. From u_3 -> R(i_4), ~R(i_4) we can infer ~u_3 via modus tollens. From p_8 <-> u_3, ~u_3 we can infer ~p_8 via biconditional elimination. Finally, from ~p_8 we can infer ~p_8 or q via addition. Therefore, the answer is yes.