ManySAT: http://www.cril.univ-artois.fr/~jabbour/manysat.htm
It shares short conflict clauses between parallel solvers and achieves superlinear speedup in some cases, e.g., 4 parallel solvers solve faster than one forth of the single solver soolution time.
Short conflict clauses are rare so there is little communication between solvers required.
CryptoMiniSAT: https://github.com/msoos/cryptominisat
Author's goal to have solver that is good in computing range from single CPU up to cluster. Judging from CryptoMiniSAT successes, he has mostly reached the goal.
Well done! I'm taking a course on SAT solvers [1], but it uses some lisp format and lets you input from a richer language (e.g. distinct, if-then-else, plus integers rather than just booleans), so I had to look up the conjunctive normal format in your app. The readme for this repo [2] sent me here [3]. Pretty simple format.
I love how fast your app is!
[1] https://www.coursera.org/learn/automated-reasoning-sat/
[2] https://github.com/msoos/cryptominisat
[3] http://www.satcompetition.org/2009/format-benchmarks2009.htm...