# Can I assume every clause of 3SAT has one positive literal?

Can we assume that each clause in 3SAT contains at least one positive literal? That is, there is no clause with all negative literals (but it is fine that there is a clause with all positive literals).

• What do you mean by "Can I assume it?", the 3CNF: $\overline{x}\lor\overline{y}\lor\overline{z}$ is satisfiable (i.e. it is in 3SAT), but does not satisfy your assumption. – Ariel Dec 14 '17 at 21:33

So if you wanting to eliminate $\lnot x$, you introduce a fresh variable $y$ and add the clauses $x \vee y$ and $\lnot y \vee \lnot x$. This is basically just encoding $\lnot x \iff y$. You can add a third dummy positive variable to ensure that these clauses also are not all negative.