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 constraints798
Best CPU time to get the best result obtained on this benchmark0.900862
(Un)Satisfiability was proved
Number of variables100
Number of constraints799
Maximum constraint arity10
Maximum domain size2
Number of constraints which are defined in extension799
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-19278590OPTIMUM 0.900862 0.906772
AbsconMax 109 PFC278588OPTIMUM 1.41478 1.45078
AbsconMax 109 EPFC278587OPTIMUM 1.78073 1.82244
toolbar 2007-01-12278592OPTIMUM 21.2588 21.2985
Toulbar2 2007-01-12278589OPTIMUM 21.5237 21.7
Toolbar_BTD 2007-01-12278591OPTIMUM 21.7857 22.0011
aolibpvo 2007-01-17278584OPTIMUM 309.94 311.246
aolibdvo 2007-01-17278585OPTIMUM 341.601 343.214
CSP4J - MaxCSP 2006-12-19278586MSAT (TO) 2400.04 2404.05