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)

- clasp
*2.0.6-R5325*(complete) (list format) - npSolver
*1.0*(complete) (list format) - npSolver
*1.0 (fixed)*(complete) (list format) - npSolver
*inc*(complete) (list format) - npSolver
*inc (fixed)*(complete) (list format) - npSolver
*inc-topDown*(complete) (list format) - npSolver
*inc-topDown (fixed)*(complete) (list format) - npSolver
*inc-topdown-quickBound*(complete) (list format) - npSolver
*inc-topdown-quickBound (fixed)*(complete) (list format) - pwbo
*2.01*(complete) (list format) - pwbo
*2.02*(complete) (list format) - Sat4j PB
*2012-05-28*(complete) (list format) - SCIP spx
*SCIP 2.1.1.4. with SoPlex 1.6.0.3 fixed*(complete) (list format) - toysat
*2012-05-17*(complete) (list format) - wbo
*1.71*(complete) (list format) - wbo
*1.72*(complete) (list format) - wbo2sat
*2012-05-19*(complete) (list format) - wbo2satCp2
*2012-05-19*(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

- Graphical comparison of two solvers based on CPU time
- Graphical comparison of two solvers based on memory

- Results for category PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints, 238 instances)
- Results for category PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints, 276 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, 133 instances)
- Results for all categories