MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
composed/composed-25-1-40/
composed-25-1-40-3_ext.xml

Jump to solvers results

General information on the benchmark

Namecomposed/composed-25-1-40/
composed-25-1-40-3_ext.xml
MD5SUM1a278fc37538a35c0edf0828cfe8a900
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints260
Best CPU time to get the best result obtained on this benchmark32.1761
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables33
Number of constraints262
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension262
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 PFC275882OPTIMUM 32.1761 32.534
AbsconMax 109 EPFC275881OPTIMUM 32.615 32.9339
Toulbar2 2007-01-12275883OPTIMUM 455.21 456.088
CSP4J - MaxCSP 2006-12-19275880MSAT (TO) 2400.02 2407.4
toolbar 2007-01-12275886MSAT (TO) 2400.05 2408.51
aolibdvo 2007-01-17275879? (TO) 2400.01 2419.43
Toolbar_BTD 2007-01-12275885? (TO) 2400.07 2406.01
aolibpvo 2007-01-17275878? (TO) 2400.07 2418.75
Toolbar_MaxSat 2007-01-19275884? (TO) 2400.09 2415.92