Theorem proving based on the partial instatiation technique

We present a new theorem proving procedure based on the partial instantiation technique, which is developed by Jeroslow. The proposed procedure is applicable to clausal form formulas in the first-order logic, as well as other resolution-based methods. We also show its completeness, i.e., it can verify that a given set of clauses is unsatisfiable if indeed it is unsatisfiable