MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints889
Best CPU time to get the best result obtained on this benchmark28.4537
(Un)Satisfiability was proved
Number of variables40
Number of constraints953
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension953
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_MaxSat 2007-01-19278014OPTIMUM 28.4537 28.6614
toolbar 2007-01-12278016OPTIMUM 39.631 39.9667
Toolbar_BTD 2007-01-12278015OPTIMUM 44.7042 45.0961
Toulbar2 2007-01-12278013OPTIMUM 251.82 251.957
aolibpvo 2007-01-17278008OPTIMUM 662.32 667.679
aolibdvo 2007-01-17278009OPTIMUM 685.451 691.104
AbsconMax 109 EPFC278011MSAT (TO) 2400.06 2400.85
AbsconMax 109 PFC278012MSAT (TO) 2400.08 2417.08
CSP4J - MaxCSP 2006-12-19278010MSAT (TO) 2400.09 2414.81