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)

- Exact
*2024-07-05*(complete) (list format) - Exact_no_SoPlex
*2024-07-05*(complete) (list format) - FiberSCIP
*2024-07-02*(complete) (list format) - FiberSCIP
*2024-07-30*(complete) (list format) - FiberSCIP
*20 cores, 2024-07-30*(complete) (list format) - NaPS
*1.03*(complete) (list format) - NaPS
*1.03a1*(complete) (list format) - NaPS
*1.03a2*(complete) (list format) - NaPS-GM
*1.03*(complete) (list format) - NaPS-GM
*1.03a1*(complete) (list format) - NaPS-GM
*1.03a2*(complete) (list format) - NaPS-PB16
*1.02b5*(complete) (list format) - Sat4j Cutting Planes 2024
*2024-07-12*(complete) (list format) - Sat4j Partial RoundingSAT 2024
*2024-07-12*(complete) (list format) - Sat4j Resolution Default
*2024-07-07*(complete) (list format) - SCIP
*2024-07-07*(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-LIN (WBO, both soft and hard constraints, linear constraints, 208 instances)
- Results for category SOFT-LIN (WBO, only soft constraints, linear constraints, 60 instances)
- Results for all categories