MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/super-queens/
normalized-super-queens-8.xml

Jump to solvers results

General information on the benchmark

Namecsp/super-queens/
normalized-super-queens-8.xml
MD5SUMcd97e8f7f9b4ac982d62b737eb37200e
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMSAT TO
Best Number of falsified constraints4
Best CPU time to get the best result obtained on this benchmark1600.71
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints590
Maximum constraint arity2
Maximum domain size20
Number of constraints which are defined in extension0
Number of constraints which are defined in intension590
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
AbsconMax 112 pc-d1112660MSAT (TO)4 1600.71 4000.08
AbsconMax 112 pc-w1112659MSAT (TO)4 1617.93 4000.03
Concrete + CSP4J - MCRW Engine 2008-05-301112657MSAT (TO)4 3600.04 3605.62
Concrete + CSP4J - Tabu Engine 2008-05-301112658MSAT (TO)4 3600.05 3620.62
Sugar v1.13+minisat1112662MSAT (TO)9 3600.02 3622.07
Sugar++ v1.13+minisat-inc1112661MSAT (TO)9 3600.07 3604.04

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: 4
Solution found:
8 1 10 2 15 3 9 4 16 1 5 2 10 3 17 2 6 1 20 4 17 3 14 4 11 1 18 2 5 1 7 3 12 2 19 1 8 3 13 2