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 constraints245
Best CPU time to get the best result obtained on this benchmark32.4621
(Un)Satisfiability was provedNO
Number of variables33
Number of constraints247
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension247
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 EPFC275854OPTIMUM 32.4621 32.5901
AbsconMax 109 PFC275855OPTIMUM 38.0572 38.1594
Toulbar2 2007-01-12275856OPTIMUM 634.966 639.688
CSP4J - MaxCSP 2006-12-19275853MSAT (TO) 2400.04 2418.81
toolbar 2007-01-12275859MSAT (TO) 2400.11 2400.82
Toolbar_MaxSat 2007-01-19275857? (TO) 2400.02 2407.4
Toolbar_BTD 2007-01-12275858? (TO) 2400.02 2400.73
aolibpvo 2007-01-17275851? (TO) 2400.03 2417.22
aolibdvo 2007-01-17275852? (TO) 2400.11 2403.21