2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Subisomorphism/Subisomorphism-m1-si4-bvg/
Subisomorphism-si4-b03m-m400-04.xml

Jump to solvers results

General information on the benchmark

NameSubisomorphism/Subisomorphism-m1-si4-bvg/
Subisomorphism-si4-b03m-m400-04.xml
MD5SUM3c35b3a34944db31f268c78e4da60e39
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 benchmark0.02939
Satisfiable
(Un)Satisfiability was proved
Number of variables160
Number of constraints322
Number of domains1
Minimum domain size400
Maximum domain size400
Distribution of domain sizes[{"size":400,"count":160}]
Minimum variable degree2
Maximum variable degree16
Distribution of variable degrees[{"degree":2,"count":42},{"degree":4,"count":39},{"degree":5,"count":66},{"degree":6,"count":5},{"degree":8,"count":3},{"degree":9,"count":1},{"degree":10,"count":1},{"degree":11,"count":1},{"degree":14,"count":1},{"degree":16,"count":1}]
Minimum constraint arity1
Maximum constraint arity160
Distribution of constraint arities[{"arity":1,"count":118},{"arity":2,"count":203},{"arity":160,"count":1}]
Number of extensional constraints321
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":321},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco 2.0 (complete)4407921SAT 0.02939 0.0299901
cosoco 2.0 (complete)4396661SAT 0.029864 0.03115
cosoco 2 (complete)4389381SAT 0.030151 0.0313239
cosoco 2.O parallel (complete)4397941SAT 0.56235 0.109934
cosoco 2.0 parallel (complete)4409201SAT 0.570356 0.11698
BTD 19.07.01 (complete)4386802SAT 0.971907 0.972345
PicatSAT 2019-09-12 (complete)4394861SAT 1.74186 1.74271
choco-solver 2019-09-24 (complete)4405741SAT 1.99075 0.839595
choco-solver 2019-09-20 (complete)4403341SAT 3.49435 1.2058
choco-solver 2019-06-14 (complete)4392881SAT 3.52044 1.20745
choco-solver 2019-09-16 (complete)4398841SAT 3.89937 1.9721
AbsCon 2019-07-23 (complete)4390481SAT 4.40895 2.52679
choco-solver 2019-09-16 parallel (complete)4399441SAT 6.7447 1.50334
choco-solver 2019-09-24 parallel (complete)4406641SAT 7.043 1.5401
choco-solver 2019-09-20 parallel (complete)4404241SAT 7.12872 1.63893
choco-solver 2019-06-14 parallel (complete)4393481SAT 7.24136 1.59876
Concrete 3.12.3 (complete)4402441SAT 7.99398 3.85443
Concrete 3.10 (complete)4387261SAT 8.40141 3.78608
Concrete 3.12.2 (complete)4400641SAT 8.89258 4.11033
Concrete 3.12.2 (complete)4395761SAT 10.1161 4.30555
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4387984SAT 135.434 106.998
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4387983SAT 138.349 111.513
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405141SAT 153.84 106.983
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392281SAT 155.201 109.763
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392581SAT 158.227 112.83
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405441SAT 158.977 110.489

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] </list> <values>0 42 45 49 63 66 77 150 189 297 97 215 47 109
283 398 40 375 311 380 321 56 123 128 13 141 3 166 388 365 2 300 222 10 67 298 326 100 327 346 390 57 376 8 193 234 251 295 394 34 81 89 93
126 272 291 337 345 353 387 21 344 105 216 393 19 23 26 44 134 171 194 207 316 358 61 37 325 142 210 248 106 29 373 16 266 212 271 310 161
43 313 83 349 244 270 366 382 290 160 357 58 68 317 6 276 196 15 218 1 383 87 342 149 260 253 225 172 74 241 245 192 370 127 158 183 278 392
220 147 256 289 274 121 53 11 229 62 115 280 338 46 125 395 323 324 348 233 232 259 336 182 39 284 197 38 4 246 371 273 </values>
</instantiation>