CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/sgb/queen/
normalized-queen8-8-9.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/sgb/queen/
normalized-queen8-8-9.xml
MD5SUM11b19c7d39bfec2562dcd35eea8e40b2
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.944856
Satisfiable
(Un)Satisfiability was proved
Number of variables64
Number of constraints728
Maximum constraint arity2
Maximum domain size9
Number of constraints which are defined in extension0
Number of constraints which are defined in intension728
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-prime 1.3131089937SAT 0.944856 0.95388
bpsolver 2008-06-271089931SAT 1.14183 1.15921
Concrete + CSP4J - Tabu Engine 2008-05-301089923SAT 1.39379 1.43338
MDG-probe 2008-06-271089926SAT 1.77773 1.79776
Concrete + CSP4J - WMC Engine 2008-05-301089924SAT 1.99969 2.00705
choco2_impwdeg 2008-06-261089932SAT 2.50862 2.55435
Mistral-option 1.3141089936SAT 3.71743 3.74506
Sugar v1.13+picosat1089929SAT 3.74643 3.88931
Abscon 112v4 AC1089940SAT 6.94194 7.04242
cpHydra k_101089942SAT 13.6139 13.8112
cpHydra k_401089943SAT 13.7459 13.9938
casper zito1089939SAT 17.5483 17.6947
casper zao1089938SAT 18.0183 18.1803
Abscon 112v4 ESAC1089941SAT 19.1331 19.3755
Concrete + CPS4J 2008-05-301089925SAT 20.7988 20.8627
galac E1089935SAT 23.6374 23.9568
galac M1089934SAT 43.6674 44.1606
choco2_dwdeg 2008-06-261089933SAT 43.7314 43.8341
SAT4J CSP 2008-06-131089928SAT 57.9552 58.5492
Sugar v1.13+minisat1089930SAT 92.6479 93.6536
MDG-noprobe 2008-06-271089927SAT 364.165 367.703
Minion/Tailor 2008-07-041105785? (TO) 1800.06 1807.11

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