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 constraints14
Best CPU time to get the best result obtained on this benchmark0.005998
(Un)Satisfiability was proved
Number of variables9
Number of constraints15
Maximum constraint arity2
Maximum domain size4
Number of constraints which are defined in extension15
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-17282805OPTIMUM 0.005998 0.0130409
aolibdvo 2007-01-17282806OPTIMUM 0.005998 0.0129139
Toolbar_MaxSat 2007-01-19282811OPTIMUM 0.219965 0.225472
AbsconMax 109 PFC282809OPTIMUM 0.662898 0.70976
AbsconMax 109 EPFC282808OPTIMUM 0.670897 0.726219
Toulbar2 2007-01-12282810OPTIMUM 1.17982 1.19806
Toolbar_BTD 2007-01-12282812OPTIMUM 1.18382 1.20693
toolbar 2007-01-12282813OPTIMUM 1.18382 1.20705
CSP4J - MaxCSP 2006-12-19282807? (problem) 0.280956 0.308355