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 constraints298
Best CPU time to get the best result obtained on this benchmark24.2423
(Un)Satisfiability was proved
Number of variables25
Number of constraints300
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension300
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 2007-01-12281211OPTIMUM 24.2423 24.457
Toolbar_BTD 2007-01-12281210OPTIMUM 26.014 26.2511
Toulbar2 2007-01-12281208OPTIMUM 134.398 135.034
aolibdvo 2007-01-17281204OPTIMUM 158.909 159.613
aolibpvo 2007-01-17281203OPTIMUM 167.28 167.34
AbsconMax 109 PFC281207OPTIMUM 307.545 307.98
AbsconMax 109 EPFC281206OPTIMUM 699.606 700.34
CSP4J - MaxCSP 2006-12-19281205MSAT (TO) 2400.02 2402.46
Toolbar_MaxSat 2007-01-19281209? (TO) 2400.04 2411.15