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 constraints433
Best CPU time to get the best result obtained on this benchmark5.64814
(Un)Satisfiability was proved
Number of variables40
Number of constraints641
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension641
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-19277663OPTIMUM 1.2868 1.31433
toolbar 2007-01-12277665OPTIMUM 5.64814 5.76462
Toolbar_BTD 2007-01-12277664OPTIMUM 5.95309 6.01574
aolibpvo 2007-01-17277657OPTIMUM 6.52601 6.57873
aolibdvo 2007-01-17277658OPTIMUM 7.13192 7.16715
Toulbar2 2007-01-12277662OPTIMUM 13.403 13.4972
AbsconMax 109 PFC277661OPTIMUM 818.101 825.288
AbsconMax 109 EPFC277660OPTIMUM 1029.15 1032.48
CSP4J - MaxCSP 2006-12-19277659? (problem) 0.558914 0.616471