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 constraints433
Best CPU time to get the best result obtained on this benchmark5.2702
(Un)Satisfiability was proved
Number of variables40
Number of constraints660
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension660
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
Toolbar_MaxSat 2007-01-19277636OPTIMUM 1.37279 1.39377
toolbar 2007-01-12277638OPTIMUM 5.2702 5.32508
Toolbar_BTD 2007-01-12277637OPTIMUM 5.48417 5.51518
aolibpvo 2007-01-17277630OPTIMUM 7.34588 7.41805
aolibdvo 2007-01-17277631OPTIMUM 7.95579 7.99448
Toulbar2 2007-01-12277635OPTIMUM 11.3013 11.4081
AbsconMax 109 PFC277634OPTIMUM 936.416 944.099
AbsconMax 109 EPFC277633OPTIMUM 1032.62 1038.89
CSP4J - MaxCSP 2006-12-19277632? (problem) 0.557914 0.686362