| Name | Subisomorphism/Subisomorphism-m1-si6-bvg/ Subisomorphism-si6-b09m-m200-07.xml |
| MD5SUM | ff3fbb1fa1e97710e818a2cc85beaf29 |
| 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.021599 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 120 |
| Number of constraints | 485 |
| Number of domains | 1 |
| Minimum domain size | 200 |
| Maximum domain size | 200 |
| Distribution of domain sizes | [{"size":200,"count":120}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 23 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":2},{"degree":4,"count":10},{"degree":5,"count":6},{"degree":6,"count":17},{"degree":7,"count":15},{"degree":9,"count":29},{"degree":10,"count":14},{"degree":11,"count":14},{"degree":12,"count":2},{"degree":13,"count":2},{"degree":14,"count":2},{"degree":15,"count":4},{"degree":18,"count":1},{"degree":23,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 120 |
| Distribution of constraint arities | [{"arity":1,"count":69},{"arity":2,"count":415},{"arity":120,"count":1}] |
| Number of extensional constraints | 484 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":484},{"type":"allDifferent","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco 2.0 (complete) | 4397249 | SAT | 0.021599 | 0.021766 |
| cosoco 2.0 (complete) | 4408509 | SAT | 0.021889 | 0.021569 |
| cosoco 2 (complete) | 4389969 | SAT | 0.021992 | 0.0218249 |
| NACRE 1.0.5-Hybrid (complete) | 4391369 | SAT | 0.282603 | 0.283148 |
| miniBTD 19.06.16 (complete) | 4391769 | SAT | 0.286076 | 0.28644 |
| NACRE 1.0.5 (complete) | 4391569 | SAT | 0.286262 | 0.286483 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407668 | SAT | 1.23396 | 1.23463 |
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 5 10 11 19 27 58 74 75 83 87 104 121 122 123 125 146 147 148 164 173 190 4 7 13 42 44 45 66 73 127 168 151 167 131 187 14 46 50 51 69 109 132 157 199 8 30 77 97 126 149 150 28 49 68 171 197 3 17 60 61 101 115 124 163 174 178 32 71 94 116 117 128 183 59 78 153 188 16 57 37 99 111 112 113 129 177 18 12 35 62 86 181 189 23 70 169 195 31 84 105 6 88 191 26 24 54 82 98 106 192 159 194 21 34 53 55 96 135 137 </values> </instantiation>