The authors have built a start-up based on these ideas:
They provide their SAT solver as a service that you can try.
A related paper I recommend in this context is NP-complete Problems and Physical Reality by Scott Aaronson:
They provide their SAT solver as a service that you can try.
A related paper I recommend in this context is NP-complete Problems and Physical Reality by Scott Aaronson:
Previous work: https://arxiv.org/pdf/1411.4798.pdf
Their web page says: "We are currently in Alpha Test. Users can submit problems via our SaaS portal in Conjunctive Normal Form (CNF), which ultimately represents the normal form of Boolean propositions for the problem’s variables and constraints"
I have no problem providing real, hard SAT instances in CNF. It should be really easy to verify whether they have something good, unless they have a size restriction.