MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/haystacks/
normalized-haystacks-11.xml

Jump to solvers results

General information on the benchmark

Namecsp/haystacks/
normalized-haystacks-11.xml
MD5SUM6480b46caccb72f6573546fdfc3ebfd9
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark15.7596
Satisfiable
(Un)Satisfiability was proved
Number of variables121
Number of constraints615
Maximum constraint arity2
Maximum domain size11
Number of constraints which are defined in extension0
Number of constraints which are defined in intension615
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar++ v1.13+minisat-inc1112345OPTIMUM1 15.7596 16.2089
Sugar v1.13+minisat1112346OPTIMUM1 17.6703 18.1259
AbsconMax 112 pc-d1112344MSAT (TO)1 1642.39 4000.04
AbsconMax 112 pc-w1112343MSAT (TO)1 1766.57 4000.34
Concrete + CSP4J - Tabu Engine 2008-05-301112342MSAT (TO)1 3600.02 3607.12
Concrete + CSP4J - MCRW Engine 2008-05-301112341MSAT (TO)1 3600.08 3626.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:
6 0 0 9 9 4 7 5 5 3 4 10 5 2 2 10 5 4 7 5 3 1 8 7 10 5 5 7 9 6 5 1 0 7 3 6 9 5 6 9 8 2 10 9 4 8 4 6 8 8 1 1 10 9 2 10 8 3 3 1 5 0 2 6 4 2 1
3 3 10 4 10 8 4 0 0 7 7 8 0 4 6 0 0 7 9 3 6 6 2 6 9 5 4 1 7 2 3 7 9 1 2 7 3 10 9 8 8 10 3 10 9 8 1 1 2 2 0 4 1 6