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 constraints269
Best CPU time to get the best result obtained on this benchmark1.19582
(Un)Satisfiability was proved
Number of variables80
Number of constraints289
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension289
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-19277771OPTIMUM 0.45893 0.469151
aolibdvo 2007-01-17277766OPTIMUM 1.19582 1.21342
aolibpvo 2007-01-17277765OPTIMUM 1.9597 1.98082
toolbar 2007-01-12277773OPTIMUM 2.26166 2.28952
Toolbar_BTD 2007-01-12277772OPTIMUM 2.43863 2.47165
Toulbar2 2007-01-12277770OPTIMUM 2.55661 2.5926
AbsconMax 109 PFC277769OPTIMUM 815.622 816.961
AbsconMax 109 EPFC277768OPTIMUM 981.391 986.978
CSP4J - MaxCSP 2006-12-19277767? (problem) 0.417935 0.457511