2018 XCSP3 competition: sequential solvers tracks: solvers results per benchmarks

Result page for benchmark
QuadraticAssignment/
QuadraticAssignment-esc128_c18.xml

Jump to solvers results

General information on the benchmark

NameQuadraticAssignment/
QuadraticAssignment-esc128_c18.xml
MD5SUM76ce32fb4bedcb1ec6c5e9897c61dbaf
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark32
Best CPU time to get the best result obtained on this benchmark2520.03
Satisfiable
(Un)Satisfiability was proved
Number of variables16512
Number of constraints63
Number of domains2
Minimum domain size7
Maximum domain size128
Distribution of domain sizes[{"size":7,"count":62},{"size":128,"count":128}]
Minimum variable degree0
Maximum variable degree10
Distribution of variable degrees[{"degree":0,"count":16322},{"degree":1,"count":97},{"degree":2,"count":68},{"degree":3,"count":5},{"degree":4,"count":5},{"degree":5,"count":2},{"degree":6,"count":4},{"degree":8,"count":8},{"degree":10,"count":1}]
Minimum constraint arity3
Maximum constraint arity128
Distribution of constraint arities[{"arity":3,"count":62},{"arity":128,"count":1}]
Number of extensional constraints62
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":62},{"type":"allDifferent","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - Hybrid 2018-07-02 (complete)4291572SAT (TO)32 2400.04 2346.03
Choco-solver 4.0.7 seq (493a269) (complete)4292330SAT (TO)32 2400.06 2392.12
Mistral-2.0 2018-06-15 (complete)4289399SAT (TO)32 2400.08 2400.3
Choco-solver 4.0.7b seq (e747e1e) (complete)4306624SAT (TO)32 2520.03 2511.71
Mistral-2.0 2018-08-01 (complete)4303686SAT (TO)32 2520.03 2520.01
OscaR - Hybrid 2018-08-14 (complete)4308504SAT (TO)32 2520.06 2466.94
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290374SAT (TO)33 2400.09 2390.44
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307918SAT (TO)33 2520.08 2511.42
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311654SAT (TO)33 2520.13 2509.44
Concrete 3.8 2018-06-13 (complete)4293869SAT (TO)37 2520.07 2492.43
Concrete 3.8-SuperNG 2018-06-13 (complete)4293870SAT (TO)37 2520.09 2488.95
Concrete 3.9.2-SuperNG (complete)4304408SAT (TO)38 2520.06 2489.43
cosoco 1.12 (complete)4293871SAT (TO)42 2520.02 2519.7
Concrete 3.9.2 (complete)4304407SAT (TO)59 2520.06 2487.04
Sat4j-CSP 2018-07-11 (complete)4289887? 417.661 154.211
PicatSAT 2018-06-15 (complete)4293872? (TO) 2519.84 2520
PicatSAT 2018-08-14 (complete)4309440? (TO) 2520.06 2519.9
PicatSAT 2018-08-02 (complete)4303100? (TO) 2520.09 2520.02

Additionnal information

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

objective function: 32
Solution found:
<instantiation> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20]
x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43]
x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] x[64] x[65] x[66]
x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89]
x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108] x[109] x[110]
x[111] x[112] x[113] x[114] x[115] x[116] x[117] x[118] x[119] x[120] x[121] x[122] x[123] x[124] x[125] x[126] x[127] d[4][27] d[4][86]
d[4][112] d[13][15] d[30][32] d[30][34] d[30][35] d[32][34] d[32][35] d[34][35] d[35][42] d[35][79] d[39][41] d[39][42] d[41][42] d[42][79]
d[46][47] d[46][52] d[46][86] d[46][87] d[46][93] d[47][50] d[50][52] d[52][86] d[52][87] d[52][93] d[61][63] d[65][68] d[65][70] d[65][72]
d[65][74] d[65][76] d[65][78] d[65][79] d[68][70] d[68][72] d[68][74] d[68][76] d[68][78] d[68][79] d[70][72] d[70][74] d[70][76] d[70][78]
d[70][79] d[72][74] d[72][76] d[72][78] d[72][79] d[74][76] d[74][78] d[74][79] d[76][78] d[76][79] d[78][79] d[80][86] d[80][93] d[86][87]
d[86][93] d[86][112] d[87][93] d[110][112] </list> <values> 114 76 22 3 125 20 100 122 83 10 5 6 123 27 7 31 118 32 2 0 4 38 12 110 17 18 28
124 21 15 24 26 25 23 8 9 106 34 35 37 39 33 41 42 36 44 116 112 11 48 80 50 84 52 53 54 55 56 57 58 59 60 61 62 63 79 113 30 67 68 69 46 71
45 75 78 65 13 77 73 93 127 81 82 40 66 85 86 87 88 89 90 19 92 111 94 95 96 97 72 99 1 101 102 103 104 105 64 107 43 119 91 117 121 108 51
115 74 14 109 70 16 29 98 47 49 126 120 0 1 0 0 0 0 1 1 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 0 0 0 0 1 1 0 0 2 0 1 1 0 0 0 2 1 0 2 0 0 1 1 1 1 2 1
1 0 1 0 0 0 0 1 1 0 1 0 </values> </instantiation>