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 constraints577
Best CPU time to get the best result obtained on this benchmark1.27181
(Un)Satisfiability was proved
Number of variables351
Number of constraints578
Maximum constraint arity3
Maximum domain size10
Number of constraints which are defined in extension578
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
AbsconMax 109 PFC280631OPTIMUM 1.27181 1.27657
AbsconMax 109 EPFC280630OPTIMUM 1.2818 1.34103
aolibdvo 2007-01-17280628OPTIMUM 1.86372 1.8648
Toulbar2 2007-01-12280632OPTIMUM 76.7653 76.929
Toolbar_BTD 2007-01-12280634OPTIMUM 78.4491 78.8261
toolbar 2007-01-12280635OPTIMUM 82.2005 82.5724
CSP4J - MaxCSP 2006-12-19280629? (problem) 0.924858 0.992089
Toolbar_MaxSat 2007-01-19280633? (MO) 1.08 1.14647
aolibpvo 2007-01-17280627Wrong Opt. 115.261 116.333