$3-$SAT. Given n Boolean variables x$1,$ x$2,...,$ xN and a logical formula in conjunction normal form $($product$-$of$-$sums$)$ with exactly $3$ distinct literals per clause, is there an assignment of truth variables that makes the formula satisfiable?