In this case our instance is CNF Boolean formula (that is a collection of clauses) over set of variables V.
And our solution is a truth-assignment f to V.
The measure of our solution is a number of satisfied clauses.
Of course this problem is NP-hard, it is not in PO (unless P = NP)
