MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/bddSmall/
normalized-bdd-21-133-18-78-15_ext.xml
MD5SUM9a27b31e5d394fb73a6ac3e5063f5218
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints8
Best CPU time to get the best result obtained on this benchmark407.304
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-271111082OPTIMUM8 321.393 324.337
AbsconMax 112 pc-w1111077OPTIMUM8 407.304 407.494
AbsconMax 112 pc-d1111078OPTIMUM8 431.53 435.636
toulbar2/BTD 2008-06-271111081OPTIMUM8 480.957 483.309
Concrete + CSP4J - MCRW Engine 2008-05-301111075MSAT (TO)8 3600.04 3605.92
Concrete + CSP4J - Tabu Engine 2008-05-301111076MSAT (TO)8 3600.09 3627.92
Sugar v1.13+minisat1111080? 111.841 112.985
Sugar++ v1.13+minisat-inc1111079? 112.011 112.733

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