SYNOPSISdepqbf [options ...] [NUM] [FILE]
DESCRIPTIONdepqbf 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.
depqbf 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.
OPTIONSdepqbf 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.