| Name | Subisomorphism/Subisomorphism-m1-si6-bvg/ Subisomorphism-si6-b06-m200-07.xml |
| MD5SUM | d7eafb215ab3d3f066855d3513f44111 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.030068 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 120 |
| Number of constraints | 355 |
| Number of domains | 1 |
| Minimum domain size | 200 |
| Maximum domain size | 200 |
| Distribution of domain sizes | [{"size":200,"count":120}] |
| Minimum variable degree | 4 |
| Maximum variable degree | 7 |
| Distribution of variable degrees | [{"degree":4,"count":2},{"degree":5,"count":2},{"degree":6,"count":2},{"degree":7,"count":114}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 120 |
| Distribution of constraint arities | [{"arity":2,"count":354},{"arity":120,"count":1}] |
| Number of extensional constraints | 354 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":354},{"type":"allDifferent","count":1}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<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] </list> <values>0 1 29 44 127 135 138 139 192 31 40 137 70 47 35 53 100 18 50 95 23 196 112 94 148 180 45 85 27 73 7 90 38 149 144 5 140 28 126 34 179 119 93 162 42 107 152 78 32 87 123 15 156 56 103 83 82 191 147 169 67 71 106 3 25 176 159 165 24 74 128 170 167 80 51 52 11 16 160 136 194 37 86 115 96 69 131 125 99 72 8 185 98 92 17 12 153 33 30 89 39 154 81 68 193 22 101 6 174 168 189 175 2 97 172 190 122 21 14 108 </values> </instantiation>