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_13: P_6(x_13) or Q_8(x_13). forall x_13: Q_1(x_13) -> Q_13(x_13). forall x_13: T_4(x_13) or ~Q_8(x_13). forall x_13: T_4(x_13) <-> Q_13(x_13). forall x_13: P_6(x_13) -> T_4(x_13).
forall x_13: Q_8(x_13) -> T_4(x_13) can be inferred via the universal rewriting rule. forall x_13: T_4(x_13) -> Q_13(x_13) can be inferred via the universal biconditional elimination rule. forall x_13: Q_13(x_13) -> T_4(x_13) can be inferred via the universal biconditional elimination rule.