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 constraints645
Best CPU time to get the best result obtained on this benchmark5.33219
(Un)Satisfiability was proved
Number of variables40
Number of constraints681
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension681
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-19277996OPTIMUM 5.33219 5.35625
toolbar 2007-01-12277998OPTIMUM 15.5816 15.6694
Toolbar_BTD 2007-01-12277997OPTIMUM 16.0656 16.1473
Toulbar2 2007-01-12277995OPTIMUM 71.9921 72.1138
aolibpvo 2007-01-17277990OPTIMUM 110.064 110.428
aolibdvo 2007-01-17277991OPTIMUM 118.782 119.834
CSP4J - MaxCSP 2006-12-19277992MSAT (TO) 2400 2403.27
AbsconMax 109 EPFC277993MSAT (TO) 2400.12 2401.48
AbsconMax 109 PFC277994MSAT (TO) 2400.12 2413.11