MAX-CSP 2006 Competition: results by benchmark

Results by benchmark for category n-ary constraints in intension (N-ARY-INT), subcategory problems with patterns

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).

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
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:
AbsconMax 109 EPFC
AbsconMax 109 PFC
CSP4J - MaxCSP 2006-12-19

Bench nameBest results
on this
instance		AbsconMax
109 EPFC		AbsconMax
109 PFC		CSP4J - MaxCSP
2006-12-19
schurrLemma/
lemma-100-9-mod.xml		 MSAT TO
f=2070
TT=2400.09

 MSAT (TO)
f=2070
TT=2400.11
T1=57.09
 MSAT (TO)
f=2070
TT=2400.09
T1=57.29
 MSAT (TO)
f=1968
TT=2400.07
T1=12.9
schurrLemma/
lemma-12-9-mod.xml		 MOPT
f=29
TT=49.029

 OPTIMUM
f=29
TT=70.194
T1=0.55
 OPTIMUM
f=29
TT=49.029
T1=0.58
 MSAT (TO)
f=29
TT=2400.02
T1=0.58
schurrLemma/
lemma-15-9-mod.xml		 MSAT TO
f=46
TT=2400.01

 MSAT (TO)
f=46
TT=2400.15
T1=0.57
 MSAT (TO)
f=46
TT=2400.12
T1=0.59
 MSAT (TO)
f=46
TT=2400.01
T1=0.75
schurrLemma/
lemma-20-9-mod.xml		 MSAT TO
f=83
TT=2400.07

 MSAT (TO)
f=83
TT=2400.08
T1=0.61
 MSAT (TO)
f=83
TT=2400.07
T1=0.63
 MSAT (TO)
f=81
TT=2400.05
T1=0.95
schurrLemma/
lemma-24-3.xml		 MOPT
f=131
TT=1.681

 OPTIMUM
f=131
TT=2.88
T1=0.75
 OPTIMUM
f=131
TT=1.681
T1=0.65
 MSAT (TO)
f=131
TT=2400.05
T1=0.87
schurrLemma/
lemma-30-9-mod.xml		 MSAT TO
f=189
TT=2400.12

 MSAT (TO)
f=189
TT=2400.12
T1=19.66
 MSAT (TO)
f=189
TT=2400.17
T1=19.7
 MSAT (TO)
f=179
TT=2400.08
T1=1.58
schurrLemma/
lemma-50-9-mod.xml		 MSAT TO
f=520
TT=2400.13

 MSAT (TO)
f=520
TT=2400.16
T1=21.64
 MSAT (TO)
f=520
TT=2400.13
T1=22.7
 MSAT (TO)
f=492
TT=2400.09
T1=3.36

Some statistics...

AbsconMax
109 EPFC		AbsconMax
109 PFC		CSP4J - MaxCSP
2006-12-19
Number of times the solver is able to give the best known answer771
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)571