Pseudo-Boolean Competition 2010

The 2010 pseudo-Boolean competition is organized as a special event of the SAT 2010 conference. Like the previous evaluations and competitions(PB05, PB06, PB07, PB09), the goal is to assess the state of the art in the field of pseudo-Boolean solvers.

For questions, comments and any other issue regarding the PB competition, please get in touch with

Competition results

Available solvers descriptions

Competition instances

New this year

The 2010 competition is very similar to the 2009 edition, with 2 exceptions: You can download a flyer advertising the competition. Disseminating this flyer is welcome :-)


As last year, two judges are in charge of taking the decisions that couldn't or shouldn't be taken by the organizers.
The organizers are greatly indebted to Heidi Dixon (author of the pbChaff solver) and Peter Barth (author of the opbdp solver) who have accepted this task.

Solvers submitted by the organizers

Vasco Manquinho has submitted the following solvers


The timetable of the 2010 evaluation is detailed below.

Opening of registration site May 3, 2010
Submitters must request a login on the registration site by May 15, 2010
Solvers and benchmarks submission deadline
May 30, 2010
Solvers running Early June 2010
Solvers description must be provided by June 21, 2010
Results will be given during the SAT 2010 conference July 11-July 14, 2010

Call for solvers

We encourage the submission of any kind of pseudo-Boolean solver (complete or incomplete solvers, working on linear or non-linear constraints, etc.). There are a few simple requirements to ensure that a submitted solver will correctly operate in the evaluation environment. It is expected that any pseudo-Boolean solver can be easily modified to conform to these requirements. People interested in submitting a solver can contact the organizers to get some help.

All the details about the input format, the output of the solver and its running environment are available in this PDF file.

Sample code, parsers for a few languages and a few programming tips are also available.

Benchmarks to test your solvers (as well as the results of the competitions) are available from the PB07 and PB09 sites
Some test instances are available for the new WBO format. They were artificially generated by adding a cost to the constraints of pigeon-hole instances. Instances were generated with 0%, and approximately 25%, 50% and 75% of hard constraints (directories soft, partial25, partial50 and partial75 respectively). Other instances were generated with a top cost set to 50 (directories *-topcost). You can download the archive with all these instances: wbo-examples.tar.bz2.

Solver submitters implicitly accept that the results of their solver be publicly available on the evaluation web site.
Solver submitters are strongly encouraged to make their solver publicly available, either in source code or in executable format. However, this is not a requirement for entering the evaluation.

Solvers submitted by the organizers

Organizers may submit their solvers but the submitted solvers must be publicly available (either in source code or in executable format) on May 23, 2010.

Call for benchmarks

Benchmarks may be submitted in any reasonable format. The organizers will do their best to translate the submitted benchmarks to the input format adopted for the evaluation. A benchmark submitted in the format of the evaluation will still be normalized to ensure consistency among all the input files.

We would particularly appreciate the submission of
Submitted benchmarks will be made available on the evaluation web site shortly after the beginning of the evaluation. We cannot accept benchmarks which are not publicly available (because anyone must be able to reproduce the experiments of the evaluation).

Benchmarks submitters may provide a description of their benchmarks set to be made available on the evaluation web site.

Benchmarks of the previous evalutaion can be downloaded from the PB07 site and PB09 site


To reach the organizers, send an email to

INESC-ID, Lisboa, Portugal
vmm at / home page
CRIL, Université d'Artois, France
olivier.roussel at / home page