depqbf - a solver for quantified boolean formulae
is a search-based solver for quantified boolean formulae (QBF) in
prenex conjunctive normal form. It is based on the DPLL algorithm for QBF with
conflict-driven clause and solution-driven cube learning. By analyzing the
structure of a formula, DepQBF tries to identify independent variables. In
addition to other benefits, this often increases freedom for decision making.
See also the JSAT system description of DepQBF 0.1 from QBFEVAL'10 for
references and a brief outline of the idea.
reads QBF formulas in QDIMACS format. If FILE
is not given,
it reads its input from stdin. It complies with input/output standards as
required by QBFEVAL'10.
accepts the following options:
- -h, --help
- Print usage information.
- Print version.
- Only parse and print formula.
- Increase verbosity incrementally.
- Optional: time-out after NUM seconds.
- Optional: read input from FILE.
The exit status is 10 if the QBF formula given as input is satisfiable, and 20
if it is unsatisfiable; any other exit code indicates that the formula was not
depqbf was written by Florian Lonsing <email@example.com>.
This manual page was written by Thomas Krennwallner