MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/bddSmall/
normalized-bdd-21-133-18-78-35_ext.xml
MD5SUMf12aa674e1e25f7644743d078b8c85b0
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 benchmark414.723
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-271111066OPTIMUM8 400.092 403.93
AbsconMax 112 pc-d1111062OPTIMUM8 414.723 418.409
AbsconMax 112 pc-w1111061OPTIMUM8 416.442 416.662
toulbar2/BTD 2008-06-271111065OPTIMUM8 587.823 593.757
Concrete + CSP4J - Tabu Engine 2008-05-301111060MSAT (TO)8 3600.01 3619.82
Concrete + CSP4J - MCRW Engine 2008-05-301111059MSAT (TO)8 3600.01 3604.12
Sugar v1.13+minisat1111064? 246.79 249.19
Sugar++ v1.13+minisat-inc1111063? 253.853 253.966

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