MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/bddLarge/
normalized-bdd-21-2713-15-79-30_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/bddLarge/
normalized-bdd-21-2713-15-79-30_ext.xml
MD5SUMf4b0831cfbfe50123ce0653823b7d047
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints43
Best CPU time to get the best result obtained on this benchmark805.326
Satisfiable
(Un)Satisfiability was proved
Number of variables21
Number of constraints2713
Maximum constraint arity15
Maximum domain size2
Number of constraints which are defined in extension2713
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
AbsconMax 112 pc-w1109315OPTIMUM43 805.326 805.344
AbsconMax 112 pc-d1109316OPTIMUM43 913.575 925.848
Concrete + CSP4J - Tabu Engine 2008-05-301109314MSAT (TO)43 3600.02 3625.12
Concrete + CSP4J - MCRW Engine 2008-05-301109313MSAT (TO)43 3600.05 3602.32
Sugar v1.13+minisat1109318? 249.617 249.779
Sugar++ v1.13+minisat-inc1109317? 253.494 254.839
toulbar2 2008-06-271109320? (MO) 67.38 67.7146
toulbar2/BTD 2008-06-271109319? (MO) 68.15 68.8155

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Number of falsified constraints: 43
Solution found:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0