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 constraints622
Best CPU time to get the best result obtained on this benchmark0.099984
(Un)Satisfiability was proved
Number of variables50
Number of constraints625
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension625
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-17280735OPTIMUM 0.099984 0.11211
aolibdvo 2007-01-17280736OPTIMUM 0.132979 0.139331
Toolbar_MaxSat 2007-01-19280741OPTIMUM 0.562913 0.572543
Toulbar2 2007-01-12280740OPTIMUM 22.4626 22.7036
toolbar 2007-01-12280743OPTIMUM 24.0873 24.3128
Toolbar_BTD 2007-01-12280742OPTIMUM 24.2083 24.4173
AbsconMax 109 EPFC280738OPTIMUM 31.0433 31.1378
AbsconMax 109 PFC280739OPTIMUM 31.5852 31.8992
CSP4J - MaxCSP 2006-12-19280737? 0.293954 0.342068