MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/bddSmall/
normalized-bdd-21-133-18-78-6_ext.xml
MD5SUMbb3a0d25b4f15a6692787655661115f5
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints2
Best CPU time to get the best result obtained on this benchmark253.215
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-d1111094OPTIMUM2 253.215 253.41
AbsconMax 112 pc-w1111093OPTIMUM2 255.833 258.308
toulbar2 2008-06-271111098OPTIMUM2 318.32 321.354
toulbar2/BTD 2008-06-271111097OPTIMUM2 485.986 490.751
Concrete + CSP4J - MCRW Engine 2008-05-301111091MSAT (TO)2 3600.04 3604.32
Concrete + CSP4J - Tabu Engine 2008-05-301111092MSAT (TO)2 3600.06 3614.12
Sugar v1.13+minisat1111096? 248.369 250.786
Sugar++ v1.13+minisat-inc1111095? 255.002 257.34

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