2019 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Subisomorphism/Subisomorphism-m1-SF/
Subisomorphism-F-20.xml

Jump to solvers results

General information on the benchmark

NameSubisomorphism/Subisomorphism-m1-SF/
Subisomorphism-F-20.xml
MD5SUM82ee18a9f0b9eb8094027018544c12e6
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark233.201
Satisfiable
(Un)Satisfiability was proved
Number of variables270
Number of constraints5395
Number of domains1
Minimum domain size300
Maximum domain size300
Distribution of domain sizes[{"size":300,"count":270}]
Minimum variable degree16
Maximum variable degree224
Distribution of variable degrees[{"degree":16,"count":1},{"degree":17,"count":7},{"degree":18,"count":6},{"degree":19,"count":13},{"degree":20,"count":22},{"degree":21,"count":13},{"degree":23,"count":10},{"degree":24,"count":13},{"degree":25,"count":12},{"degree":26,"count":12},{"degree":27,"count":11},{"degree":28,"count":11},{"degree":29,"count":8},{"degree":30,"count":4},{"degree":31,"count":7},{"degree":32,"count":10},{"degree":33,"count":3},{"degree":34,"count":8},{"degree":35,"count":5},{"degree":36,"count":7},{"degree":37,"count":4},{"degree":38,"count":2},{"degree":39,"count":5},{"degree":40,"count":2},{"degree":41,"count":2},"...",{"degree":69,"count":2}, {"degree":71,"count":1}, {"degree":72,"count":1}, {"degree":77,"count":1}, {"degree":78,"count":1}, {"degree":95,"count":1}, {"degree":97,"count":1}, {"degree":100,"count":2}, {"degree":103,"count":1}, {"degree":105,"count":1}, {"degree":107,"count":1}, {"degree":110,"count":1}, {"degree":111,"count":1}, {"degree":122,"count":1}, {"degree":124,"count":1}, {"degree":131,"count":2}, {"degree":133,"count":1}, {"degree":137,"count":1}, {"degree":142,"count":1}, {"degree":167,"count":1}, {"degree":173,"count":1}, {"degree":183,"count":1}, {"degree":187,"count":1}, {"degree":220,"count":1}, {"degree":224,"count":1}]
Minimum constraint arity1
Maximum constraint arity270
Distribution of constraint arities[{"arity":1,"count":208},{"arity":2,"count":5186},{"arity":270,"count":1}]
Number of extensional constraints5394
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":5394},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 19.06.16 (complete)4391960SAT 233.201 233.224
cosoco 2.0 (complete)4397440? (TO) 2400.01 2400.11
cosoco 2.0 (complete)4408700? (TO) 2400.02 2399.7
cosoco 2 (complete)4390160? (TO) 2400.02 2400.2
NACRE 1.0.5 (complete)4391760? (TO) 2400.09 2400.42
(reference) PicatSAT 2019-09-12 (complete)4407658? (TO) 2400.12 2400.23
NACRE 1.0.5-Hybrid (complete)4391560? (TO) 2400.13 2400.33

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:
Solution found:
<instantiation type="solution"> <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] x[128]
x[129] x[130] x[131] x[132] x[133] x[134] x[135] x[136] x[137] x[138] x[139] x[140] x[141] x[142] x[143] x[144] x[145] x[146] x[147] x[148]
x[149] x[150] x[151] x[152] x[153] x[154] x[155] x[156] x[157] x[158] x[159] x[160] x[161] x[162] x[163] x[164] x[165] x[166] x[167] x[168]
x[169] x[170] x[171] x[172] x[173] x[174] x[175] x[176] x[177] x[178] x[179] x[180] x[181] x[182] x[183] x[184] x[185] x[186] x[187] x[188]
x[189] x[190] x[191] x[192] x[193] x[194] x[195] x[196] x[197] x[198] x[199] x[200] x[201] x[202] x[203] x[204] x[205] x[206] x[207] x[208]
x[209] x[210] x[211] x[212] x[213] x[214] x[215] x[216] x[217] x[218] x[219] x[220] x[221] x[222] x[223] x[224] x[225] x[226] x[227] x[228]
x[229] x[230] x[231] x[232] x[233] x[234] x[235] x[236] x[237] x[238] x[239] x[240] x[241] x[242] x[243] x[244] x[245] x[246] x[247] x[248]
x[249] x[250] x[251] x[252] x[253] x[254] x[255] x[256] x[257] x[258] x[259] x[260] x[261] x[262] x[263] x[264] x[265] x[266] x[267] x[268]
x[269] </list> <values> 287 284 188 201 235 176 24 266 159 124 249 137 116 211 177 262 224 259 244 269 169 185 286 161 154 202 101 166 115
86 143 264 14 97 231 64 129 234 78 293 98 204 267 11 213 45 288 250 292 178 285 59 110 168 227 54 13 220 193 189 60 221 283 77 248 138 66
123 19 70 208 119 256 12 117 50 257 146 43 90 62 140 255 122 298 170 144 80 17 69 105 275 167 165 289 270 25 239 0 157 171 79 108 254 93 102
145 111 113 209 207 95 187 2 199 226 56 205 8 46 40 241 141 87 29 28 290 48 41 155 282 173 10 160 263 156 277 65 37 194 118 135 246 196 57
36 106 153 42 273 198 23 104 21 58 291 51 75 15 47 174 200 297 219 142 27 258 147 230 73 217 148 195 238 128 190 112 149 261 35 240 276 130
55 52 162 191 114 278 107 9 34 16 76 100 225 61 133 183 31 253 136 206 26 1 99 151 215 7 152 131 139 260 281 214 251 44 6 91 197 229 125 182
179 252 82 184 268 96 294 71 216 103 222 126 67 74 271 181 83 175 94 223 49 203 20 3 72 192 236 5 272 172 243 247 85 212 4 237 228 280 296
134 18 232 92 164 158 242 120 </values> </instantiation>