MAX-CSP 2006 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecomposed/composed-25-1-2/
composed-25-1-2-1_ext.xml
MD5SUMff72b5549f71496c7cc07b984a9ace3f
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints221
Best CPU time to get the best result obtained on this benchmark36.2655
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables33
Number of constraints224
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension224
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 EPFC276100OPTIMUM 36.2655 36.3523
AbsconMax 109 PFC276101OPTIMUM 38.1012 38.4301
CSP4J - MaxCSP 2006-12-19276099MSAT (TO) 2400.01 2403.23
toolbar 2007-01-12276105MSAT (TO) 2400.06 2401.71
Toulbar2 2007-01-12276102MSAT (TO) 2400.1 2411.92
Toolbar_MaxSat 2007-01-19276103? (TO) 2400.03 2411.22
Toolbar_BTD 2007-01-12276104? (TO) 2400.06 2411.04
aolibpvo 2007-01-17276097? (TO) 2400.08 2419.57
aolibdvo 2007-01-17276098? (TO) 2400.09 2409.88