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

Result page for benchmark
Subisomorphism/Subisomorphism-m1-si6-m4D/
Subisomorphism-si6-m4D-m256-08.xml

Jump to solvers results

General information on the benchmark

NameSubisomorphism/Subisomorphism-m1-si6-m4D/
Subisomorphism-si6-m4D-m256-08.xml
MD5SUMe08b74c1d6e9f7e08abc14a201f93ec8
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.030555
Satisfiable
(Un)Satisfiability was proved
Number of variables153
Number of constraints543
Number of domains1
Minimum domain size256
Maximum domain size256
Distribution of domain sizes[{"size":256,"count":153}]
Minimum variable degree3
Maximum variable degree10
Distribution of variable degrees[{"degree":3,"count":2},{"degree":4,"count":15},{"degree":6,"count":28},{"degree":7,"count":34},{"degree":8,"count":41},{"degree":9,"count":29},{"degree":10,"count":4}]
Minimum constraint arity1
Maximum constraint arity153
Distribution of constraint arities[{"arity":1,"count":136},{"arity":2,"count":406},{"arity":153,"count":1}]
Number of extensional constraints542
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":542},{"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)4408507SAT 0.030555 0.0307481
cosoco 2 (complete)4389967SAT 0.031078 0.0310031
cosoco 2.0 (complete)4397247SAT 0.031125 0.0308009
NACRE 1.0.5-Hybrid (complete)4391367SAT 0.232641 0.238404
NACRE 1.0.5 (complete)4391567SAT 0.236048 0.240562
miniBTD 19.06.16 (complete)4391767SAT 0.488854 0.489265
(reference) PicatSAT 2019-09-12 (complete)4407655SAT 6.70976 6.7095

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] </list> <values>214 90 143 78 198 29 61 0 156 1 182 17 150 193 56 32 234 128 71 197 229 164 238 65 75 130 213 54
174 110 146 116 80 113 175 93 144 145 88 28 132 157 63 119 170 46 252 189 221 180 112 19 241 87 133 247 222 176 105 124 33 236 181 186 7 107
148 69 179 177 163 70 44 49 12 18 10 167 30 220 251 254 202 206 27 158 126 147 162 117 123 225 15 55 3 233 104 240 169 66 108 149 57 20 101
6 77 208 36 142 81 13 24 192 35 231 68 237 226 42 4 23 98 218 245 168 216 21 184 215 154 255 209 122 85 109 84 73 194 205 9 72 11 86 59 62
190 106 155 47 141 120 79 </values> </instantiation>