title: Any NP to SAT. How to do that and prove that it is possible?
body: <p>Let's start here:
  It is said that all <strong>NP problems</strong> can be reduced to <strong>SAT</strong>(boolean satisfiability problem). To be more accurate to <strong>Circuit SAT</strong>, because all decision problems like NP should end up with answer <strong>Yes</strong> or <strong>No</strong>. </p>
  
  <p>But now, if I have a random NP problem, how to build a boolean circuit to test, how to group my input, what kind of <strong>gates</strong>(AND, NOT, OR etc..) should connect those inputs. So basically, my question how to design <strong>boolean Circuit</strong> which gives an answer <strong>TRUE or FALSE</strong>.</p>
  
  <p>Last thing, what that answer means. I understand TRUE as this NP problem can be solved in <strong>polynomial time</strong> and FALSE cannot, am I correct?</p>
  
  <p>It is huge mess in my mind, don't be really outrageous if I made logical mistakes explaining my question :) I hope you understood it.</p>
  
  <p>Excitingly waiting for answers.</p>