MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/haystacks/
normalized-haystacks-05.xml
MD5SUMb084f028e7005bf0c5095ca4dd6df57b
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 benchmark1.21081
Satisfiable
(Un)Satisfiability was proved
Number of variables25
Number of constraints54
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension0
Number of constraints which are defined in intension54
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+minisat1112334OPTIMUM1 1.21081 1.43383
Sugar++ v1.13+minisat-inc1112333OPTIMUM1 1.22981 1.74427
AbsconMax 112 pc-w1112331OPTIMUM1 846.722 2014.63
AbsconMax 112 pc-d1112332OPTIMUM1 1070.06 2560.22
Concrete + CSP4J - MCRW Engine 2008-05-301112329MSAT (TO)1 3600.06 3625.62
Concrete + CSP4J - Tabu Engine 2008-05-301112330MSAT (TO)1 3600.09 3604.33

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:
2 1 0 4 3 0 2 1 4 1 4 4 1 0 3 3 2 2 4 3 2 2 1 0 3