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 constraints249
Best CPU time to get the best result obtained on this benchmark0.270958
(Un)Satisfiability was proved
Number of variables68
Number of constraints271
Maximum constraint arity3
Maximum domain size4
Number of constraints which are defined in extension271
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
aolibdvo 2007-01-17282887OPTIMUM 0.270958 0.276878
aolibpvo 2007-01-17282886OPTIMUM 1.52477 1.54022
Toolbar_BTD 2007-01-12282893OPTIMUM 4.44032 4.48745
toolbar 2007-01-12282894OPTIMUM 5.61515 5.67507
Toulbar2 2007-01-12282891OPTIMUM 6.91695 7.07079
AbsconMax 109 EPFC282889MSAT (TO) 2400.08 2419.45
AbsconMax 109 PFC282890MSAT (TO) 2400.1 2411.74
CSP4J - MaxCSP 2006-12-19282888? (problem) 0.444932 0.456651
Toolbar_MaxSat 2007-01-19282892? (TO) 2400.11 2406.45