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 constraints300
Best CPU time to get the best result obtained on this benchmark36.1105
(Un)Satisfiability was provedNO
Number of variables33
Number of constraints302
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension302
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 EPFC275329OPTIMUM 36.1105 36.2149
AbsconMax 109 PFC275330OPTIMUM 42.9865 43.4057
Toulbar2 2007-01-12275331OPTIMUM 95.7784 96.1686
CSP4J - MaxCSP 2006-12-19275328MSAT (TO) 2400.06 2403.11
toolbar 2007-01-12275334MSAT (TO) 2400.13 2409.99
Toolbar_MaxSat 2007-01-19275332? (TO) 2400.03 2411
Toolbar_BTD 2007-01-12275333? (TO) 2400.08 2421.05
aolibdvo 2007-01-17275327? (TO) 2400.09 2406.24
aolibpvo 2007-01-17275326? (TO) 2400.11 2410.31