Let be given the function f by a conjunctive form with n = 5 clauses:

f = (x1 ∨ x3 ∨ x4)(x2 ∨ x3 ∨ x4)(x2 ∨ x3 ∨ x4)(x1 ∨ x2 ∨ x3)(x1 ∨ x2 ∨ x3).

1 Represent the same function by k clauses, k ≤ n where the clauses are taken from the existing set of clauses and no further clause can be omitted.