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 constraints93
Best CPU time to get the best result obtained on this benchmark2.03269
(Un)Satisfiability was proved
Number of variables28
Number of constraints189
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension189
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
aolibdvo 2007-01-17278657OPTIMUM 2.03269 2.03561
aolibpvo 2007-01-17278656OPTIMUM 2.10368 2.12394
toolbar 2007-01-12278664OPTIMUM 5.39818 5.41433
Toolbar_BTD 2007-01-12278663OPTIMUM 5.50016 5.51365
Toulbar2 2007-01-12278661OPTIMUM 6.30404 6.36984
AbsconMax 109 EPFC278659OPTIMUM 376.873 379.959
AbsconMax 109 PFC278660OPTIMUM 567.411 571.915
CSP4J - MaxCSP 2006-12-19278658? (problem) 0.448931 0.508583
Toolbar_MaxSat 2007-01-19278662? (TO) 2400.06 2400.99