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

Result page for benchmark
Subisomorphism/Subisomorphism-m1-si2-bvg/
Subisomorphism-si2-b03m-m800-09.xml

Jump to solvers results

General information on the benchmark

NameSubisomorphism/Subisomorphism-m1-si2-bvg/
Subisomorphism-si2-b03m-m800-09.xml
MD5SUMfd69e77754fb96838bac76ad2b6503f8
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.041766
Satisfiable
(Un)Satisfiability was proved
Number of variables160
Number of constraints341
Number of domains1
Minimum domain size800
Maximum domain size800
Distribution of domain sizes[{"size":800,"count":160}]
Minimum variable degree3
Maximum variable degree24
Distribution of variable degrees[{"degree":3,"count":75},{"degree":4,"count":30},{"degree":5,"count":47},{"degree":6,"count":3},{"degree":12,"count":1},{"degree":14,"count":1},{"degree":15,"count":1},{"degree":17,"count":1},{"degree":24,"count":1}]
Minimum constraint arity1
Maximum constraint arity160
Distribution of constraint arities[{"arity":1,"count":160},{"arity":2,"count":180},{"arity":160,"count":1}]
Number of extensional constraints340
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":340},{"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)4397265SAT 0.041766 0.0420731
cosoco 2 (complete)4389985SAT 0.042068 0.042163
cosoco 2.0 (complete)4408525SAT 0.04729 0.0474429
NACRE 1.0.5 (complete)4391585SAT 0.226832 0.227367
NACRE 1.0.5-Hybrid (complete)4391385SAT 0.232272 0.232546
miniBTD 19.06.16 (complete)4391785SAT 3.60957 3.6091
(reference) PicatSAT 2019-09-12 (complete)4407681SAT 3.62754 3.62735

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 1 2 10 18 43 94 153 292 183 573 758 351 413
499 527 551 250 596 644 663 753 171 86 156 193 287 405 426 474 496 572 590 612 622 772 782 57 144 575 247 304 395 497 175 577 628 731 748 37
149 154 344 404 450 632 722 777 791 52 74 80 131 327 442 600 643 237 263 785 799 367 662 127 651 364 593 532 184 550 732 120 535 291 373 28
779 381 216 19 240 6 11 303 438 431 123 336 35 93 539 189 112 679 602 660 564 380 690 790 794 178 585 504 41 751 3 20 623 198 586 756 694
645 13 108 305 689 21 211 674 69 394 63 710 199 12 346 301 400 17 173 160 125 604 508 206 342 345 32 316 268 770 388 285 136 48 4 717 261
</values> </instantiation>