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 constraints52
Best CPU time to get the best result obtained on this benchmark0.05599
(Un)Satisfiability was proved
Number of variables20
Number of constraints53
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension53
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-17282247OPTIMUM 0.05599 0.056122
aolibdvo 2007-01-17282248OPTIMUM 0.055991 0.0574119
AbsconMax 109 PFC282251OPTIMUM 0.777881 0.9016
AbsconMax 109 EPFC282250OPTIMUM 0.78388 0.812166
Toulbar2 2007-01-12282252OPTIMUM 2.84357 2.85741
toolbar 2007-01-12282255OPTIMUM 3.10253 3.13456
Toolbar_BTD 2007-01-12282254OPTIMUM 3.14052 3.16336
CSP4J - MaxCSP 2006-12-19282249? 0.272958 0.292603
Toolbar_MaxSat 2007-01-19282253? (TO) 2400.01 2400.73