The minimal unsatisfiability problem is considered of the propositional formulas in CNF which in the case of variables x1,…, xn consist of n+k clauses including x1V…Vxn and （?） -（X1）V…V（?）xn. It is shown that when k≤4 the minimal unsatisfiability problem can be solved in polynomial time.
