MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/bddSmall/
normalized-bdd-21-133-18-78-19_ext.xml
MD5SUMf4688f0c1e61ecbc5601338febdf76bd
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints3
Best CPU time to get the best result obtained on this benchmark269.981
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
toulbar2 2008-06-271111010OPTIMUM3 221.202 222.321
AbsconMax 112 pc-d1111006OPTIMUM3 269.981 272.594
AbsconMax 112 pc-w1111005OPTIMUM3 294.533 297.15
toulbar2/BTD 2008-06-271111009OPTIMUM3 398.53 400.827
Concrete + CSP4J - MCRW Engine 2008-05-301111003MSAT (TO)3 3600.02 3608.52
Concrete + CSP4J - Tabu Engine 2008-05-301111004MSAT (TO)3 3600.05 3614.92
Sugar++ v1.13+minisat-inc1111007? 230.52 230.695
Sugar v1.13+minisat1111008? 279.408 282.187

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