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 constraints32
Best CPU time to get the best result obtained on this benchmark23.1035
(Un)Satisfiability was proved
Number of variables15
Number of constraints105
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension105
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 2007-01-12281463OPTIMUM 23.1035 23.2285
Toolbar_BTD 2007-01-12281462OPTIMUM 24.6732 24.9081
Toulbar2 2007-01-12281460OPTIMUM 75.8705 76.0434
aolibdvo 2007-01-17281456OPTIMUM 315.72 317.188
aolibpvo 2007-01-17281455OPTIMUM 315.952 318.619
AbsconMax 109 EPFC281458OPTIMUM 1123.65 1132.84
AbsconMax 109 PFC281459MSAT (TO) 2400.08 2405.71
CSP4J - MaxCSP 2006-12-19281457? (problem) 0.378941 0.399416
Toolbar_MaxSat 2007-01-19281461? (TO) 2400.02 2405.78