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 constraints3634
Best CPU time to get the best result obtained on this benchmark38.0642
(Un)Satisfiability was proved
Number of variables2686
Number of constraints3635
Maximum constraint arity3
Maximum domain size10
Number of constraints which are defined in extension3635
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
Toulbar2 2007-01-12280623OPTIMUM 38.0642 38.4122
AbsconMax 109 PFC280622OPTIMUM 39.9099 40.2555
AbsconMax 109 EPFC280621OPTIMUM 41.4637 41.5497
CSP4J - MaxCSP 2006-12-19280620? (problem) 5.13722 5.26478
Toolbar_MaxSat 2007-01-19280624? (MO) 0.030995 2.37716
aolibpvo 2007-01-17280618? (MO) 8.64169 8.64285
aolibdvo 2007-01-17280619? (MO) 8.69468 8.89481
toolbar 2007-01-12280626? (MO) 37.75 37.9784
Toolbar_BTD 2007-01-12280625? (TO) 2400.04 2411.27