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 constraints396
Best CPU time to get the best result obtained on this benchmark10.6594
(Un)Satisfiability was proved
Number of variables80
Number of constraints399
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension399
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-19277897OPTIMUM 10.6594 10.7187
toolbar 2007-01-12277899OPTIMUM 13.475 13.5437
Toolbar_BTD 2007-01-12277898OPTIMUM 14.9017 15.0105
Toulbar2 2007-01-12277896OPTIMUM 78.1471 78.7449
aolibpvo 2007-01-17277891OPTIMUM 689.876 694.595
aolibdvo 2007-01-17277892OPTIMUM 774.954 778.564
CSP4J - MaxCSP 2006-12-19277893MSAT (TO) 2400.05 2404.13
AbsconMax 109 PFC277895MSAT (TO) 2400.1 2405.48
AbsconMax 109 EPFC277894MSAT (TO) 2400.14 2404.06