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 constraints299
Best CPU time to get the best result obtained on this benchmark8.30874
(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
AbsconMax 109 PFC281180OPTIMUM 8.30874 8.47512
toolbar 2007-01-12281184OPTIMUM 9.02763 9.06733
Toolbar_BTD 2007-01-12281183OPTIMUM 9.33358 9.41602
Toulbar2 2007-01-12281181OPTIMUM 13.12 13.2395
AbsconMax 109 EPFC281179OPTIMUM 20.6169 20.917
aolibpvo 2007-01-17281176OPTIMUM 101.521 102.37
aolibdvo 2007-01-17281177OPTIMUM 102.841 102.878
CSP4J - MaxCSP 2006-12-19281178MSAT (TO) 2400.07 2400.86
Toolbar_MaxSat 2007-01-19281182? (TO) 2400.06 2401.09