This page displays the results of the different solvers for each benchmark for category n-ary constraints in intension (N-ARY-INT), subcategory problems with patterns
REMINDER
Keep in mind that the 'Best result' columns only provide the best result given by one of the solvers. This 'Best result' may be wrong in case of an UNSATISFIABLE or OPTIMUM FOUND answer (because there's no efficient way to check these answers). |
Cell example | Meaning |
---|---|
Answer | Solver result |
f=... | value of the objective function for the model reported by the solver |
TT=... | Total Time (TT): this is the CPU time (in seconds) used by the solver until termination. This time is only meaningful for complete solvers because incomplete solvers will always run until they time out |
Remember that CPU time and wall clock time are two very different notions. The CPU time represents the time during which the instructions of the solver were executed by the processor. The wall clock time represents how much time ellapsed on the clock. For a same event, the CPU time may be either smaller or greater than the wall clock time depending on the number of threads of execution and the number of processors. |
Abbreviation | Meaning |
---|---|
f=... | Value of the objective function |
TO | Time Out |
MO | Mem. Out (out of memory) |
Color | Meaning |
---|---|
text | the solver cannot handle this instance |
text | the solver gave no answer |
text | the solver could give an answer (SAT) |
text | the solver gave a definitive answer (OPTIMUM FOUND or UNSAT) |
text | the solver performed better than the other ones on that instance |
text | the solver was ended by a signal |
text | the solver gave an incomplete answer |
text | the solver was disqualified in the category |
text | the solver gave a wrong answer |
For better readability, you may choose to hide some solvers:
AbsconMax 109 EPFC
AbsconMax 109 PFC
CSP4J - MaxCSP 2006-12-19
AbsconMax 109 EPFC | AbsconMax 109 PFC | CSP4J - MaxCSP 2006-12-19 | |
---|---|---|---|
Number of times the solver is able to give the best known answer | 7 | 7 | 1 |
Number of times the solver is the best solver from a complete solver point of view (i.e. best known answer and best TT time) | 5 | 7 | 1 |