title: Converting Not All Equal 2-Sat Pr0blem to an equivalent 2-SAT pr0blem
body: <p>I'm looking over previous exam papers, and have come across this question which has confused me. </p>
  
  <p>Question:</p>
  
  <blockquote>
    <p>Convert the Not-All-Equal 2-SAT problem given by the clauses <code>{x1, x2}, {x2, x3}, {x3, x4}, {x4, x5}, {x5, x1}</code> to an equivalent 2-SAT problem. (Hint: the 2-SAT problem contains 10 clauses).</p>
  </blockquote>
  
  <p>From my understanding, is this simply finding the negation for each literal in every clause? So for example, <code>{x1, x2} = {-x1, -x2}</code>, and this is done for each clause?
  Is this correct? </p>