[Solved] 3SAT solved in polynomial time?

Question

In the 3-Sat in CNF all clauses are OR-clauses and they are combined by AND. So the two lines you cite define the following two clauses

x5 or x17 or x19
(not x5) or (not x17) or (not x19)

which can both be satisfied, for example, by setting x5 to true, x17 to false, and x19 arbitrary.

Accepted Answer

In the 3-Sat in CNF all clauses are OR-clauses and they are combined by AND. So the two lines you cite define the following two clauses

x5 or x17 or x19
(not x5) or (not x17) or (not x19)

which can both be satisfied, for example, by setting x5 to true, x17 to false, and x19 arbitrary.