CSP 2009 Competition: solvers results per benchmarks

Result page for benchmark
csp/nengfa/
normalized-queens1.xml

Jump to solvers results

General information on the benchmark

Namecsp/nengfa/
normalized-queens1.xml
MD5SUM72b10381b21e6b6e79bdf3ac7e3009a4
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 benchmark4.6263
Satisfiable
(Un)Satisfiability was proved
Number of variables96
Number of constraints13680
Maximum constraint arity2
Maximum domain size96
Number of constraints which are defined in extension0
Number of constraints which are defined in intension13680
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Abscon 112v4 AC (complete)2096983SAT 4.6263 4.70865
Abscon 112v4 ESAC (complete)2096984SAT 4.75827 4.8566
Mistral 1.545 (complete)2078839SAT 5.38018 5.40698
Choco2.1.1b 2009-07-16 (complete)2116403SAT 6.74697 6.79258
Choco2.1.1 2009-06-10 (complete)2078835SAT 7.07892 7.10156
Sugar v1.14.6+minisat (complete)2078837SAT 12.2541 78.1087
pcs-restart 0.3.2 (complete)2078832SAT 16.0136 16.1719
Concrete 2009-07-14 (complete)2078833SAT 19.2671 19.5152
pcs 0.3.2 (complete)2078831SAT 27.0279 27.0374
Sugar v1.14.6+picosat (complete)2078836SAT 36.1105 36.5986
bpsolver 09 (complete)2078840SAT 60.8507 61.808
Concrete DC 2009-07-14 (complete)2078834SAT 100.644 101.644
SAT4J CSP 2.1.1 (complete)2078830? 784.553 790.336

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:
36 6 49 7 93 4 43 41 60 92 5 27 58 91 89 8 42 90 45 9 88 10 87 11 86 12 50 85 47 62 84 46 39 13 65 67 14 82 15 83 81 59 63 16 18 80 32 22 17
77 79 23 75 78 30 95 1 28 21 76 26 72 74 71 73 24 64 61 25 54 2 53 20 33 94 19 40 38 3 34 31 51 35 37 68 66 69 52 56 29 57 70 48 55 44 96