<p>I am wondering how well current Boolean Satisfiability solvers are able to perform — for example, are the best SATsolvers able to solve problems from SATlib?</p>

CC BY-SA 4.0
2022-04-08T18:46:31.787Z
This does not appear to be a question about *theoretical* computer science.  Also, this seems too vague and open-ended to be answerable.  It's not clear how you imagine to measure "how well".  If you want to know whether SAT solvers can solve problems in SATlib, the best way to find out is probably to try it.
D.W.
CC BY-SA 4.0
2022-04-08T20:22:34.267Z
Search for the most recent SAT competition results to get an idea.
Juho
CC BY-SA 4.0
2022-04-09T17:38:52.393Z
Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer.
Community
CC BY-SA 4.0
2022-04-10T17:13:18.517Z
Please edit this question to summarize the algorithm(s) that your investigation shows Boolean satisfiability solves (e.g., SATlib et. al.) are based upon fundamentally.  Then try to ascertain whether that technology's limit in practice is due to the algorithm itself or engineering lack of wisdom when implementing it.  For limits of the algorithm, please identify in the edited question what you find perplexing or an area of theoretical research.  Indeed, please edit the question: with why isn't Algorithm B utilized instead of limited Algorithm A?
Andreas ZUERCHER
<np-hardness><complexity-classes><p-vs-np><ai.artificial-intel><boolean-formulas>
What are the capabilities of current Boolean Satisfiability Solvers?
Nat Kar
# What are the capabilities of current Boolean Satisfiability Solvers?

(Asked by: username_0 on 2022-04-08)

I am wondering how well current Boolean Satisfiability solvers are able to perform — for example, are the best SATsolvers able to solve problems from SATlib?

**Tags:** np-hardness, complexity-classes, p-vs-np, ai.artificial-intel, boolean-formulas
> **Comments:**
> **username_1**: This does not appear to be a question about *theoretical* computer science.  Also, this seems too vague and open-ended to be answerable.  It's not clear how you imagine to measure "how well".  If you want to know whether SAT solvers can solve problems in SATlib, the best way to find out is probably to try it.  
> **username_2**: Search for the most recent SAT competition results to get an idea.  
> **username_3**: Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer.  
> **username_4**: Please edit this question to summarize the algorithm(s) that your investigation shows Boolean satisfiability solves (e.g., SATlib et. al.) are based upon fundamentally.  Then try to ascertain whether that technology's limit in practice is due to the algorithm itself or engineering lack of wisdom when implementing it.  For limits of the algorithm, please identify in the edited question what you find perplexing or an area of theoretical research.  Indeed, please edit the question: with why isn't Algorithm B utilized instead of limited Algorithm A?  

---

## 0 answers

