MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints267
Best CPU time to get the best result obtained on this benchmark0.541916
(Un)Satisfiability was proved
Number of variables40
Number of constraints316
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension316
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
aolibpvo 2007-01-17278359OPTIMUM 0.541916 0.549457
Toolbar_MaxSat 2007-01-19278365OPTIMUM 0.549916 0.559386
aolibdvo 2007-01-17278360OPTIMUM 0.604907 0.613676
toolbar 2007-01-12278367OPTIMUM 2.71259 2.74214
Toolbar_BTD 2007-01-12278366OPTIMUM 3.00354 3.01165
Toulbar2 2007-01-12278364OPTIMUM 3.05853 3.08079
AbsconMax 109 PFC278363OPTIMUM 70.2393 70.3628
AbsconMax 109 EPFC278362OPTIMUM 74.6347 75.4148
CSP4J - MaxCSP 2006-12-19278361? (problem) 0.408937 0.442271