MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/bddSmall/
normalized-bdd-21-133-18-78-33_ext.xml
MD5SUM544241c6edafdacfd9bc5e484f0e4bb8
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 benchmark223.986
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-271111042OPTIMUM1 172.91 174.575
AbsconMax 112 pc-w1111037OPTIMUM1 223.986 224.079
AbsconMax 112 pc-d1111038OPTIMUM1 257.369 259.867
toulbar2/BTD 2008-06-271111041OPTIMUM1 341.502 345.135
Concrete + CSP4J - Tabu Engine 2008-05-301111036MSAT (TO)1 3600.01 3601.33
Concrete + CSP4J - MCRW Engine 2008-05-301111035MSAT (TO)1 3600.04 3611.32
Sugar++ v1.13+minisat-inc1111039? 218.741 220.864
Sugar v1.13+minisat1111040? 255.879 257.899

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 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0