MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints198
Best CPU time to get the best result obtained on this benchmark5.9251
(Un)Satisfiability was proved
Number of variables30
Number of constraints330
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension330
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-19279814OPTIMUM 1.64375 1.67157
toolbar 2007-01-12279816OPTIMUM 5.9251 5.99915
Toolbar_BTD 2007-01-12279815OPTIMUM 6.28304 6.36882
aolibpvo 2007-01-17279808OPTIMUM 13.408 13.4655
aolibdvo 2007-01-17279809OPTIMUM 13.7969 13.9043
Toulbar2 2007-01-12279813OPTIMUM 15.1337 15.1967
AbsconMax 109 PFC279812OPTIMUM 250.949 251.232
AbsconMax 109 EPFC279811OPTIMUM 371.247 374.439
CSP4J - MaxCSP 2006-12-19279810MSAT (TO) 2400.01 2409.95