3-CNF formula (${\bigwedge }_i({\ell }_{i,1}\vee {\ell }_{i,2}\vee {\ell }_{i,3})$)

A Boolean formula in conjunctive normal form with at most three Boolean literals per Boolean clause. A shorter nonempty Boolean clause can be padded by repeating a Boolean literal. The corresponding Boolean satisfiability problem is 3-SAT.