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 constraints375
Best CPU time to get the best result obtained on this benchmark1.71074
(Un)Satisfiability was proved
Number of variables40
Number of constraints390
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension390
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-19278005OPTIMUM 1.71074 1.73794
toolbar 2007-01-12278007OPTIMUM 6.75697 6.76811
Toolbar_BTD 2007-01-12278006OPTIMUM 7.01693 7.07888
Toulbar2 2007-01-12278004OPTIMUM 15.4596 15.4775
aolibpvo 2007-01-17277999OPTIMUM 18.1322 18.2835
aolibdvo 2007-01-17278000OPTIMUM 19.501 19.672
AbsconMax 109 EPFC278002OPTIMUM 313.797 314.027
AbsconMax 109 PFC278003OPTIMUM 328.735 331.559
CSP4J - MaxCSP 2006-12-19278001MSAT (TO) 2400.1 2421.69