[HelloNurse]

Well said. Other NP-complete problems might yield a better demo than SAT: for instance, algorithms for graph problems like coloring or Hamiltonian cycles can be executed on randomly generated large graphs, without the complication of parsing user inputs such as boolean formulas and without offering to the public a "service" that can be used to crack cryptography etc.