Every problem X in NP can be reduced in polynomial time to SAT by encoding the computation of the ac...