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