What can be inferred from the following premises in a single inference step (ignoring inferences that add new predicates or constants)? Name the inference rule being used: forall x_11: T(x_11) -> ~Q_11(x_11). W(d) <-> s. forall x_11: W(x_11) <-> T(x_11). forall x_11: Q_11(x_11).
W(d) -> s can be inferred via the biconditional elimination rule. s -> W(d) can be inferred via the biconditional elimination rule. forall x_11: ~T(x_11) can be inferred via the universal modus tollens rule. forall x_11: W(x_11) -> T(x_11) can be inferred via the universal biconditional elimination rule. forall x_11: T(x_11) -> W(x_11) can be inferred via the universal biconditional elimination rule.