… polynomial-time reduction from SAT,

proving NP-completeness of 3SAT.

For each clause \(c\) in a SAT instance,

---