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_4: T_3(x_4) or ~T(x_4). forall x_4: S(x_4) -> T(x_4). forall x_4: T(x_4) -> S(x_4).
forall x_4: T(x_4) -> T_3(x_4) can be inferred via the universal rewriting rule. forall x_4: S(x_4) <-> T(x_4) can be inferred via the universal biconditional introduction rule. forall x_4: T(x_4) <-> S(x_4) can be inferred via the universal biconditional introduction rule.