In a 3-CNF clause, we require that at least one literal per clause be True in order to satisfy the clause. The 3SAT problem asks if there is an assignment that can satisfy all clauses simultaneously. We can make variants of the 3SAT problem by retaining the same general setup, (n variables, m clauses, 3 literals per clause), but then changing the requirement needed to satisfy a clause. Either show that this variant of 3SAT is NP-Complete, or give a polynomial time algorithm that solves it:

At Least Two 3SAT is a variant of 3SAT where at least TWO literals per clause need to be True.