| Name | Subisomorphism/Subisomorphism-m1-si6-bvg/ Subisomorphism-si6-b09-m200-08.xml |
| MD5SUM | 7f9c41aacca1e0b30cdd7db3c30aaf94 |
| 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.033514 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 120 |
| Number of constraints | 517 |
| Number of domains | 1 |
| Minimum domain size | 200 |
| Maximum domain size | 200 |
| Distribution of domain sizes | [{"size":200,"count":120}] |
| Minimum variable degree | 5 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":5,"count":2},{"degree":6,"count":4},{"degree":7,"count":4},{"degree":8,"count":4},{"degree":9,"count":2},{"degree":10,"count":104}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 120 |
| Distribution of constraint arities | [{"arity":2,"count":516},{"arity":120,"count":1}] |
| Number of extensional constraints | 516 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":516},{"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 13 29 63 104 130 134 137 180 185 32 65 89 94 189 26 42 133 115 1 41 142 143 83 135 97 5 58 147 171 183 9 87 172 92 187 111 164 197 57 129 24 101 120 139 144 25 98 123 152 14 113 82 91 105 114 188 161 12 75 146 103 112 18 162 50 90 124 49 106 95 72 79 167 70 148 33 3 74 19 149 122 100 11 23 53 35 64 166 99 128 150 88 78 151 71 193 157 126 156 96 169 181 36 131 195 153 110 138 85 56 86 81 118 191 30 20 192 6 160 </values> </instantiation>