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 constraints471
Best CPU time to get the best result obtained on this benchmark1.69174
(Un)Satisfiability was proved
Number of variables40
Number of constraints488
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension488
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-19278050OPTIMUM 1.69174 1.699
toolbar 2007-01-12278052OPTIMUM 8.34173 8.41737
Toolbar_BTD 2007-01-12278051OPTIMUM 8.5167 8.569
Toulbar2 2007-01-12278049OPTIMUM 16.1345 16.301
aolibpvo 2007-01-17278044OPTIMUM 17.1384 17.1444
aolibdvo 2007-01-17278045OPTIMUM 19.975 20.1452
AbsconMax 109 EPFC278047OPTIMUM 387.606 391.374
AbsconMax 109 PFC278048OPTIMUM 393.459 393.639
CSP4J - MaxCSP 2006-12-19278046MSAT (TO) 2400.05 2411.22