Release 2

• License added
• Clause distribution-based preprocessing introduced, substantially increasing reliability when solving low clause-to-variable cnfs.
• Added ability to run multiple simulations interlaced instead of sequentially.

Initial Release

This implements essentially all the features mentioned in the original paper, except the non-euler integration methods. It can solve many hard SAT instances, but testing shows that for many classes of problems, particularly those with low clause-to-variable ratios, it often struggles where other SAT solvers would succeed. But, for many large problems with a high clause-to-variable ratio, it often succeeds where other solvers would struggle. It's in a usable enough state for experimentation purposes.