Page "Boolean satisfiability problem" Paragraph 23

TRUE, x < sub > 3 </ sub >= TRUE, x < sub > 4 </ sub >= TRUE ), so the answer to this instance is YES.

This is one of many possible assignments, with for instance, any set of assignments including x < sub > 1 </ sub > = TRUE being sufficient.

If there were no such assignment ( s ), the answer would be NO.