MAX-CSP 2006 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecomposed/composed-25-1-40/
composed-25-1-40-7_ext.xml
MD5SUMe81361ec4d2007a67e83ac3c416ef1c1
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 benchmark34.9077
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 PFC275891OPTIMUM 34.9077 35.2868
AbsconMax 109 EPFC275890OPTIMUM 35.9015 36.148
CSP4J - MaxCSP 2006-12-19275889MSAT (TO) 2400.05 2412.59
toolbar 2007-01-12275895MSAT (TO) 2400.08 2409.69
Toulbar2 2007-01-12275892MSAT (TO) 2400.12 2416.49
aolibdvo 2007-01-17275888? (TO) 2400.02 2417.87
Toolbar_MaxSat 2007-01-19275893? (TO) 2400.04 2401.43
Toolbar_BTD 2007-01-12275894? (TO) 2400.04 2411.73
aolibpvo 2007-01-17275887? (TO) 2400.08 2402.8