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 constraints440
Best CPU time to get the best result obtained on this benchmark3.89941
(Un)Satisfiability was proved
Number of variables40
Number of constraints611
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension611
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-19277690OPTIMUM 1.14882 1.16568
aolibpvo 2007-01-17277684OPTIMUM 3.89941 3.93961
aolibdvo 2007-01-17277685OPTIMUM 4.16537 4.20546
toolbar 2007-01-12277692OPTIMUM 4.69929 4.73287
Toolbar_BTD 2007-01-12277691OPTIMUM 4.92125 4.95474
Toulbar2 2007-01-12277689OPTIMUM 6.79497 6.86245
AbsconMax 109 PFC277688OPTIMUM 321.809 323.347
AbsconMax 109 EPFC277687OPTIMUM 366.669 369.1
CSP4J - MaxCSP 2006-12-19277686? (problem) 0.550915 0.613283