MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/bddSmall/
normalized-bdd-21-133-18-78-22_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/bddSmall/
normalized-bdd-21-133-18-78-22_ext.xml
MD5SUMa3b26cfc92262632d1cf0d2e0f067aa3
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark211.044
Satisfiable
(Un)Satisfiability was proved
Number of variables21
Number of constraints133
Maximum constraint arity18
Maximum domain size2
Number of constraints which are defined in extension133
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-w1111053OPTIMUM1 211.044 213.082
AbsconMax 112 pc-d1111054OPTIMUM1 212.307 214.153
toulbar2 2008-06-271111058OPTIMUM1 349.929 350.736
toulbar2/BTD 2008-06-271111057OPTIMUM1 470.267 472.858
Concrete + CSP4J - MCRW Engine 2008-05-301111051MSAT (TO)1 3600.03 3620.02
Concrete + CSP4J - Tabu Engine 2008-05-301111052MSAT (TO)1 3600.07 3634.12
Sugar++ v1.13+minisat-inc1111055? 91.6201 91.9368
Sugar v1.13+minisat1111056? 100.627 101.729

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: 1
Solution found:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 1 1