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 constraints44
Best CPU time to get the best result obtained on this benchmark2.35864
(Un)Satisfiability was proved
Number of variables25
Number of constraints63
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension63
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
aolibdvo 2007-01-17281663OPTIMUM 2.35864 2.38345
aolibpvo 2007-01-17281662OPTIMUM 3.50147 3.53425
toolbar 2007-01-12281670OPTIMUM 4.6193 4.62769
Toolbar_BTD 2007-01-12281669OPTIMUM 4.83526 4.84319
Toulbar2 2007-01-12281667OPTIMUM 5.01224 5.10401
AbsconMax 109 EPFC281665OPTIMUM 214.315 216.227
AbsconMax 109 PFC281666OPTIMUM 324.56 327.377
CSP4J - MaxCSP 2006-12-19281664? (problem) 0.391939 0.45626
Toolbar_MaxSat 2007-01-19281668? (TO) 2400.07 2414.57