This site gives some information based on the answers provided by the different solvers. Not all answers given by a solver can be checked efficiently. Therefore, some answers given by a solver may be wrong but this may be unnoticed by the evaluation environment.

Here are the checks made for each answer.

- SATISFIABLE answers:

The model provided by the solver is given to a verifier program which checks that all constraints are actually satisfied. These answers are the only ones that are guaranteed to be true. - UNSATISFIABLE answers:

The only check that is made is to verify that no other solver found a solution to this instance. An UNSATISFIABLE answer is not reliable. Some solvers may wrongly indicate UNSATISFIABLE but unless another solver finds a model, this will remain undetected. - OPTIMUM FOUND answers:

Beyond verifying the model and the value of the objective function, the only check that is made is to verify that no other solver found a better solution to this instance. An OPTIMUM FOUND answer is not reliable. Some solvers may wrongly indicate OPTIMUM FOUND but unless another solver finds a better model, this will remain undetected.

- Information about solvers (command line, supported categories,...)
- Information about selected instances (no solver result)

- Ranking of solvers
- All solvers (tabular format, summary)
- All solvers (tabular format, detailed results)

- pb_cplex
*2010-07-01*(complete) (list format) - PB/CT
*0.1*(complete) (list format) - PB/CT
*0.1 fixed*(complete) (list format) - SAT4J PB CuttingPlanes
*2.2.0 2010-05-26*(complete) (list format) - SAT4J PB RES // CP
*2.2.0 2010-05-31*(complete) (list format) - SAT4J PB Resolution
*2.2.0 2010-05-26*(complete) (list format) - SAT4J PB Resolution
*2.2.1*(complete) (list format) - SCIPclp
*SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solver*(complete) (list format) - SCIPclp
*SCIP 1.2.1.3 with Clp 1.11.1 (Release Version) as LP solver*(complete) (list format) - SCIPnone
*SCIP 1.2.1.2 without any LP solver*(complete) (list format) - SCIPspx
*SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver*(complete) (list format) - wbo
*1.4a*(complete) (list format) - wbo
*1.4b*(complete) (list format)

- Number of instances solved in a given amount of time
- Number of instances solved within a given amount of memory
- Memory versus time for each solvers

- Results for category PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints, 263 instances)
- Results for category PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints, 536 instances)
- Results for category SOFT-BIGINT-LIN (only soft constraints, big integers, linear constraints, 46 instances)
- Results for category SOFT-SMALLINT-LIN (only soft constraints, small integers, linear constraints, 201 instances)
- Results for all categories