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 constraints14
Best CPU time to get the best result obtained on this benchmark0.008997
(Un)Satisfiability was proved
Number of variables13
Number of constraints15
Maximum constraint arity3
Maximum domain size6
Number of constraints which are defined in extension15
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
aolibpvo 2007-01-17280546OPTIMUM 0.008997 0.014619
aolibdvo 2007-01-17280547OPTIMUM 0.008997 0.01453
AbsconMax 109 EPFC280549OPTIMUM 0.662898 0.729616
AbsconMax 109 PFC280550OPTIMUM 0.689894 0.709881
Toolbar_MaxSat 2007-01-19280552OPTIMUM 0.721889 0.741624
toolbar 2007-01-12280554OPTIMUM 1.51277 1.53549
Toulbar2 2007-01-12280551OPTIMUM 1.51677 1.55295
Toolbar_BTD 2007-01-12280553OPTIMUM 1.67374 1.68953
CSP4J - MaxCSP 2006-12-19280548MSAT (TO) 2400.06 2401.81