-
Consider the following formulas `f1 = E x1 x2 x3 (x1 | -x2 | -x3) & (-x1 | x2 | x3)` and `f2 = E x1 x2 x3 (x1 | x2 | x3) & (-x1 | -x2 | -x3)`. In both cases, running `Qbf.solve` with `Quantor.solver` …
-
I am trying to use solver PRS (https://github.com/shaowei-cai-group/PRS-sc24/) .
Their exit code is 0 always.
```
$ /opt/PRS/sc24/bin/PRS check.cnf
s SATISFIABLE
v -1 2 0
$ echo $?
0
$ /o…
-
The CAQE paper describes a procedure for extracting Herbrand functions for a QBF problem. How do we get the CAQE solver to give us these Herbrand functions?
-
Consider the following programs / output pairs
P1:
{ a; b }.
_exists(1,a).
_exists(1,b).
The output is is fine and expected:
Running: clingo --output=smodels example4.lp …
-
We have `minisatPath` and `cryptominisat5Path` but that does not allow me to call, e.g., glucose, because it needs an extra option to print the model.
I am thinking of
```
solverPathOptions :: Mo…
-
Hi Leander! First of all, amazing work, thanks so much for using CryptoMiniSat! Do you know what was the issue with using the newest? I have tried playing with things, e.g. these repositories:
http…
msoos updated
4 years ago
-
Hi.
I am reading https://www.qbflib.org/qbfeval2022_results.php and I conclude that I want `caqe-bloqqer-qdo` (see https://github.com/ekmett/ersatz/pull/90#issuecomment-1973822608)
I build th…
-
When solving the *SAT2023_GDDL/QBF_instances/D/4x2_5_bwnib.qcir* instance on Grendel with a simple transposition, one gets the following error. This does not seem to happen for *deepest transposition*…
-
A problem in SAT solving is trusting the solver when it claims a formula to be *unsatisfiable*. To this end, the solver can create an *LRAT* (or just a *DRAT*) proof. But, doing so is not a trivial ta…
-
Call the following program with `--solve --models 0` does not iterate through all models, but stops with the first one and does not continue:
```
#ground dim[1..4].
#ground ex[x], ex[y].
ex…