MAX-CSP 2006 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecomposed/composed-25-1-25/
composed-25-1-25-3_ext.xml
MD5SUM8a77c5542f054aec87912a5b9d333e9c
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints245
Best CPU time to get the best result obtained on this benchmark35.1477
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables33
Number of constraints247
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension247
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 EPFC275836OPTIMUM 35.1477 35.4772
AbsconMax 109 PFC275837OPTIMUM 35.2986 35.7163
Toulbar2 2007-01-12275838OPTIMUM 424.783 426.902
CSP4J - MaxCSP 2006-12-19275835MSAT (TO) 2400.09 2411.56
toolbar 2007-01-12275841MSAT (TO) 2400.11 2415.44
Toolbar_BTD 2007-01-12275840? (TO) 2400.01 2409.59
Toolbar_MaxSat 2007-01-19275839? (TO) 2400.02 2411.12
aolibdvo 2007-01-17275834? (TO) 2400.04 2411.32
aolibpvo 2007-01-17275833? (TO) 2400.11 2403.86