CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/super-queens/
normalized-super-queens-2.xml
MD5SUMc461fd9f78bea6a7f910d09245157b44
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark1.11883
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints14950
Maximum constraint arity2
Maximum domain size100
Number of constraints which are defined in extension0
Number of constraints which are defined in intension14950
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cpHydra k_401084058UNSAT 1.11883 1.119
Mistral-option 1.3141084051UNSAT 1.16382 1.18603
Mistral-prime 1.3131084052UNSAT 1.23681 1.25899
MDG-noprobe 2008-06-271084042UNSAT 1.25381 1.26755
MDG-probe 2008-06-271084041UNSAT 1.25881 1.27744
cpHydra k_101084057UNSAT 1.26581 1.28293
bpsolver 2008-06-271084046UNSAT 3.15452 3.18913
Abscon 112v4 ESAC1084056UNSAT 4.95625 5.06941
Abscon 112v4 AC1084055UNSAT 5.09123 5.16827
choco2_dwdeg 2008-06-261084048UNSAT 19.796 20.0349
choco2_impwdeg 2008-06-261084047UNSAT 20.0869 20.3101
SAT4J CSP 2008-06-131084043? 850.493 856.903
galac M1084049? (MO) 376.67 380.414
galac E1084050? (MO) 1069.75 1080.12
Concrete + CPS4J 2008-05-301084040? (TO) 1800.01 1805.62
Minion/Tailor 2008-07-041107124? (TO) 1800.02 1809.91
casper zito1084054? (TO) 1800.04 1803.22
Sugar v1.13+picosat1084044? (TO) 1800.05 1808.26
casper zao1084053? (TO) 1800.06 1808.24
Sugar v1.13+minisat1084045? (TO) 1800.07 1817.16
Concrete + CSP4J - Tabu Engine 2008-05-301084038? (TO) 1800.08 1802.42
Concrete + CSP4J - WMC Engine 2008-05-301084039? (TO) 1800.09 1800.92

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found: