MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/super-queens/
normalized-super-queens-3.xml
MD5SUMd07220ca9cf8898c2c9b405e7e6368f7
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 benchmark1594.97
Satisfiable
(Un)Satisfiability was proved
Number of variables24
Number of constraints210
Maximum constraint arity2
Maximum domain size12
Number of constraints which are defined in extension0
Number of constraints which are defined in intension210
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-w1112683MSAT (TO)4 1594.97 4000.07
AbsconMax 112 pc-d1112684MSAT (TO)4 1598.14 4000.08
Concrete + CSP4J - Tabu Engine 2008-05-301112682MSAT (TO)4 3600.01 3620.52
Concrete + CSP4J - MCRW Engine 2008-05-301112681MSAT (TO)4 3600.03 3615.22
Sugar v1.13+minisat1112686MSAT (TO)6 3600.06 3628.31
Sugar++ v1.13+minisat-inc1112685MSAT (TO)6 3600.08 3612.11

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