3SAT is the satisfiability problem for propositional formulas in conjunctive
normal form with three literals in each clause.
It asks whether an assignment of truth values to the variables
makes every clause true. For example, 
is satisfiable
by setting 
to true.
3SAT
See also
2-to-1 Game, Conjunctive Normal Form, Literal, Random k-SAT, Satisfiability Problem, Sentential Formula, Unique Games ConjectureExplore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W. "3SAT." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/3SAT.html