1. Introduction
A clause is a disjunction of literals, , or denoted by a set . A formula in conjunctive normal form (CNF) is a conjunction of clauses, , or denoted by a set . var(F) is the set of variables occurring in the formula and is the set of the variables in the clause . We denote as the number of clauses of and as the number of variables occurring in . is the class of CNF formulas with variables and clauses. The deficiency of a formula is defined as , denoted by . A formula is minimal unsatisfiable (MU) if is unsatisfiable and is satisfiable for any clause . It is well known that is not minimal unsatisfiable if [4]. So, we denote MU(k) as the set of minimal unsatisfiable formulas with deficiency . Whether or not a formula belongs to MU(k) can be decided in polynomial time [5].