PTSF answers SAT instances that the world's best solvers cannot solve at all — in milliseconds. The method is proprietary.
PTSF's advantage on industrial instances is both a speed improvement and a capability boundary. On instances Kissat can solve, PTSF is 3.9× faster on average, 9.7× at peak. On instances Kissat cannot answer at all — timing out regardless of how long you wait — PTSF answers in milliseconds. This is not a faster solver. This is a different class. And it was built, validated, and deployed on consumer hardware — the performance ceiling has not been found.
A multi-stage proprietary pipeline routes each instance to the fastest sufficient method, escalating only when necessary. Full technical detail is confidential.
86.6% resolved without invoking a solver · remainder routed to a purpose-built Rust solver averaging 3.9× Kissat, peaking at 9.7×
For best results, run one instance at a time.
| n | Result | Method | ms |
|---|---|---|---|
| no classifications yet | |||
Alika Parks
(323) 989-1197 (Google Voice)
alikamp@gmail.com
For licensing inquiries, please reach out directly via phone or email.
On 86.6% of real industrial SAT instances, PTSF returns a confirmed answer in a median of 117 milliseconds — on the exact instances where Kissat, the field's three-time gold-medal solver, does not return an answer at all within any practical time budget. This is not a speed comparison; it's a capability boundary.
On the remaining 13.4%, where a solver is genuinely required, PTSF routes to a purpose-built Rust solver that exceeds Kissat by the standard metric: 3.9× faster on average, 9.7× at peak.
This is a complete, robust pipeline — not a narrow optimization, but a system that outperforms the industry's best solver at both ends of the problem: where Kissat fails outright, and where it succeeds.
Work is actively underway expanding coverage to additional industrial instance families beyond the original benchmark set. One such case has returned an output independently confirmed against CaDiCaL — with PTSF returning the answer roughly 257× faster. A second has returned an output on an instance CaDiCaL could not answer at all within any practical time budget, and for which no independent secondary verification currently exists. If independently confirmed, these additional capabilities would extend the framework's total coverage toward 90%.