MAX-CSP 2006 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecomposed/composed-25-1-80/
composed-25-1-80-1_ext.xml
MD5SUM83c7b25af1f95bba2d05432f9ef312fa
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints299
Best CPU time to get the best result obtained on this benchmark33.7559
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables33
Number of constraints302
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension302
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 PFC275339OPTIMUM 33.7559 33.9477
AbsconMax 109 EPFC275338OPTIMUM 38.4622 38.6388
CSP4J - MaxCSP 2006-12-19275337MSAT (TO) 2400.1 2402.63
Toulbar2 2007-01-12275340MSAT (TO) 2400.1 2410.34
toolbar 2007-01-12275343MSAT (TO) 2400.13 2420.44
Toolbar_MaxSat 2007-01-19275341? (TO) 2400.04 2413.15
Toolbar_BTD 2007-01-12275342? (TO) 2400.05 2419.67
aolibdvo 2007-01-17275336? (TO) 2400.05 2409.4
aolibpvo 2007-01-17275335? (TO) 2400.09 2400.94