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_1: T(x_1) -> W_1(x_1). ~w_2 or w. forall x_1: ~W_1(x_1). w_2 or T(j_4). forall x_1: W_1(x_1) -> T(x_1).
T(j_4) or w can be inferred via the resolution rule. R_1(j_4) -> w_2 can be inferred via the rewriting rule. forall x_1: ~T(x_1) can be inferred via the universal modus tollens rule. forall x_1: T(x_1) <-> W_1(x_1) can be inferred via the universal biconditional introduction rule. forall x_1: W_1(x_1) <-> T(x_1) can be inferred via the universal biconditional introduction rule.