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)

- AbsconMax
*109 EPFC*(list format) - AbsconMax
*109 PFC*(list format) - aolibdvo
*2007-01-17*(list format) - aolibpvo
*2007-01-17*(list format) - CSP4J - MaxCSP
*2006-12-19*(list format) - toolbar
*2007-01-12*(list format) - Toolbar_BTD
*2007-01-12*(list format) - Toolbar_MaxSat
*2007-01-19*(list format) - Toulbar2
*2007-01-12*(list format)

- Results for category 2-ARY-EXT (instances with only binary constraints defined in extension, 686 instances)
- Results for category ACAD (intances from the academia and which do not involve any random generator) (20 instances)
- Results for category BOOL (instances with only boolean variables) (130 instances)
- Results for category PATT (instances with a structure which follows a regular pattern (with some random generation)) (140 instances)
- Results for category QRND (random instances containing a small structure) (90 instances)
- Results for category RAND (pure random instances) (271 instances)
- Results for category REAL (instances from real world applications) (35 instances)
- Results for category 2-ARY-INT (instances with only binary constraints (some of them being defined by a predicate), 190 instances)
- Results for category ACAD (intances from the academia and which do not involve any random generator) (10 instances)
- Results for category PATT (instances with a structure which follows a regular pattern (with some random generation)) (90 instances)
- Results for category REAL (instances from real world applications) (90 instances)
- Results for category N-ARY-EXT (instances with some n-ary constraints (all constraints defined in extension), 135 instances)
- Results for category BOOL (instances with only boolean variables) (72 instances)
- Results for category PATT (instances with a structure which follows a regular pattern (with some random generation)) (2 instances)
- Results for category RAND (pure random instances) (35 instances)
- Results for category REAL (instances from real world applications) (26 instances)
- Results for category N-ARY-INT (instances with some n-ary constraints and some constraints defined by a predicate), 58 instances)
- Results for category ACAD (intances from the academia and which do not involve any random generator) (24 instances)
- Results for category BOOL (instances with only boolean variables) (27 instances)
- Results for category PATT (instances with a structure which follows a regular pattern (with some random generation)) (7 instances)
- Results for all categories

- 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