MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/BH-4-4/
normalized-BlackHole-4-4-e-2_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/BH-4-4/
normalized-BlackHole-4-4-e-2_ext.xml
MD5SUM029f2a4b6a6c6279c7ce904b18fceb49
Bench Category2-ARY-EXT (binary 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 benchmark1.60076
Satisfiable
(Un)Satisfiability was proved
Number of variables64
Number of constraints431
Maximum constraint arity2
Maximum domain size16
Number of constraints which are defined in extension431
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-271108294OPTIMUM1 1.60076 1.62059
toulbar2/BTD 2008-06-271108293OPTIMUM1 6.96194 7.96866
Sugar v1.13+minisat1108292OPTIMUM1 430.832 435.341
Sugar++ v1.13+minisat-inc1108291OPTIMUM1 1120.16 1121.94
AbsconMax 112 pc-w1108289MSAT (TO)1 1585.39 4000.06
AbsconMax 112 pc-d1108290MSAT (TO)1 1685.08 4000.07
Concrete + CSP4J - MCRW Engine 2008-05-301108287MSAT (TO)1 3600.01 3612.43
Concrete + CSP4J - Tabu Engine 2008-05-301108288MSAT (TO)1 3600.09 3602.32

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:
0 0 0 3 3 3 2 4 2 5 3 1 4 4 0 7 2 3 6 4 2 9 4 1 8 3 0 11 4 3 10 3 2 13 3 1 12 2 0 15 2 3 14 2 2 3 2 3 1 1 7 5 3 1 7 5 3 1 7 5 3 1 7 6