Show that Set Cover can be polynomial-time reduced to CNF-SAT (CNF-SAT is essentially 3SAT without the restriction of having at most 3 literals per clause).
Hint: For each set Si in the Set Cover instance, let there be a Boolean variable xi that denotes the indicator of whether Si is chosen (i.e., xi is TRUE if Si is chosen and is FALSE otherwise).