MAX-CSP 2008 Competition: results by benchmark

Results by benchmark for category global constraints (GLOBAL), subcategory problems with patterns

This page displays the results of the different solvers for each benchmark for category global constraints (GLOBAL), 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).

Description of a cell contents:

Cell exampleMeaning
AnswerSolver 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
T1=...Time to get the best model (T1): this is the wall clock time (in seconds) ellapsed when the solver found its best model. This time is obtained from the 'o lines'. It is useful to compare both complete and incomplete solvers. It doesn't take into account the time to prove optimality of the solution.
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.

Meaning of some abbreviations:

AbbreviationMeaning
f=...Value of the objective function
TOTime Out
MOMem. Out (out of memory)

Meaning of the different colors:

ColorMeaning
textthe solver cannot handle this instance
textthe solver gave no answer
textthe solver could give an answer (SAT)
textthe solver gave a definitive answer (OPTIMUM FOUND or UNSAT)
textthe solver performed better than the other ones on that instance
textthe solver was ended by a signal
textthe solver gave an incomplete answer
textthe solver was disqualified in the category
textthe solver gave a wrong answer

For better readability, you may choose to hide some solvers:
Sugar v1.13+minisat
Sugar++ v1.13+minisat-inc

Bench nameBest results
on this
instance		Sugar
v1.13+minisat		Sugar++
v1.13+minisat-inc
csp/cjss/
normalized-ft06x2-54.xml		 MOPT
f=1
TT=5.132
T1=3.23
 OPTIMUM
f=1
TT=5.77
T1=4.23
 OPTIMUM
f=1
TT=5.132
T1=3.23
csp/cjss/
normalized-ft06x3-54.xml		 MOPT
f=1
TT=188.633
T1=4.51
 OPTIMUM
f=1
TT=188.633
T1=5.54
 OPTIMUM
f=1
TT=601.017
T1=4.51
csp/rcpsp/
normalized-rcpsp20-05.xml		 MOPT
f=1
TT=2.381
T1=1.31
 OPTIMUM
f=1
TT=2.427
T1=1.36
 OPTIMUM
f=1
TT=2.381
T1=1.31
csp/rcpspTighter/
normalized-rcpsptight20-03.xml		 MOPT
f=1
TT=1.495
T1=1.25
 OPTIMUM
f=1
TT=1.564
T1=1.32
 OPTIMUM
f=1
TT=1.495
T1=1.25
csp/rcpspTighter/
normalized-rcpsptight20-11.xml		 MOPT
f=1
TT=1.328
T1=1.18
 OPTIMUM
f=1
TT=1.328
T1=1.18
 OPTIMUM
f=1
TT=1.419
T1=1.27
csp/rcpspTighter/
normalized-rcpsptight20-12.xml		 MOPT
f=1
TT=1.684
T1=1.48
 OPTIMUM
f=1
TT=1.766
T1=1.56
 OPTIMUM
f=1
TT=1.684
T1=1.48
csp/rcpspTighter/
normalized-rcpsptight20-14.xml		 MOPT
f=1
TT=2.218
T1=1.27
 OPTIMUM
f=1
TT=2.218
T1=1.33
 OPTIMUM
f=1
TT=2.377
T1=1.27
csp/rcpspTighter/
normalized-rcpsptight20-15.xml		 MOPT
f=2
TT=1.267
T1=1.09
 OPTIMUM
f=2
TT=1.267
T1=1.09
 OPTIMUM
f=2
TT=1.28
T1=1.1
csp/rcpspTighter/
normalized-rcpsptight20-16.xml		 MOPT
f=1
TT=1.47
T1=1.25
 OPTIMUM
f=1
TT=1.77
T1=1.51
 OPTIMUM
f=1
TT=1.47
T1=1.25
csp/rcpspTighter/
normalized-rcpsptight20-19.xml		 MOPT
f=1
TT=1.288
T1=1.13
 OPTIMUM
f=1
TT=1.346
T1=1.19
 OPTIMUM
f=1
TT=1.288
T1=1.13
Bench nameBest results
on this
instance		Sugar
v1.13+minisat		Sugar++
v1.13+minisat-inc
csp/rcpspTighter/
normalized-rcpsptight20-20.xml		 MOPT
f=1
TT=1.466
T1=1.26
 OPTIMUM
f=1
TT=1.466
T1=1.26
 OPTIMUM
f=1
TT=1.661
T1=1.45
csp/rcpspTighter/
normalized-rcpsptight25-21.xml		 MOPT
f=1
TT=2.458
T1=1.67
 OPTIMUM
f=1
TT=2.696
T1=2.11
 OPTIMUM
f=1
TT=2.458
T1=1.67
csp/rcpspTighter/
normalized-rcpsptight25-29.xml		 MOPT
f=1
TT=2.023
T1=1.82
 OPTIMUM
f=1
TT=2.023
T1=1.82
 OPTIMUM
f=1
TT=2.221
T1=2.01
csp/rcpspTighter/
normalized-rcpsptight25-31.xml		 MOPT
f=1
TT=1.902
T1=1.78
 OPTIMUM
f=1
TT=1.902
T1=1.78
 OPTIMUM
f=1
TT=2.135
T1=2.06
csp/rcpspTighter/
normalized-rcpsptight25-32.xml		 MOPT
f=1
TT=4.77
T1=1.78
 OPTIMUM
f=1
TT=4.936
T1=2.01
 OPTIMUM
f=1
TT=4.77
T1=1.78
csp/rcpspTighter/
normalized-rcpsptight25-35.xml		 MOPT
f=1
TT=1.817
T1=1.63
 OPTIMUM
f=1
TT=1.817
T1=1.63
 OPTIMUM
f=1
TT=1.849
T1=1.63
csp/rcpspTighter/
normalized-rcpsptight25-37.xml		 MOPT
f=1
TT=1.913
T1=1.64
 OPTIMUM
f=1
TT=2.336
T1=2.06
 OPTIMUM
f=1
TT=1.913
T1=1.64
csp/rcpspTighter/
normalized-rcpsptight25-38.xml		 MOPT
f=1
TT=2.023
T1=1.68
 OPTIMUM
f=1
TT=2.089
T1=1.8
 OPTIMUM
f=1
TT=2.023
T1=1.68

Some statistics...

Sugar
v1.13+minisat		Sugar++
v1.13+minisat-inc
Number of times the solver is able to give the best known answer1818
Number of times the solver is able to give the best known answer from an incomplete solver point of view (i.e. without considering optimality proof)1818
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)810
Number of times the solver is the best solver from an incomplete solver point of view (i.e. best known answer and best T1 time)613