Consider the following premises. forall x: U(x) or Q_3(x). forall x: R(x) -> U(x). forall x: R(x) -> ~W(x). forall x: W(x). forall x: U(x) -> R(x). Can we infer ~Q_3(d) from them? If possible, name the inference rules being used at each step.
 From forall x: R(x) -> U(x), forall x: U(x) -> R(x) we can infer forall x: R(x) <-> U(x) via universal biconditional introduction. From forall x: R(x) -> ~W(x), forall x: W(x) we can infer forall x: ~R(x) via universal modus tollens. From forall x: R(x) <-> U(x), forall x: ~R(x) we can infer forall x: ~U(x) via universal biconditional elimination. Finally, from forall x: U(x) or Q_3(x), forall x: ~U(x) we can infer forall x: Q_3(x) via universal disjunctive syllogism, which contradicts ~Q_3(d). Therefore, the answer is no.