| Name | TravellingSalesman/TravellingSalesman-m1-n100/ TravellingSalesman-100-50-02.xml |
| MD5SUM | 0e4189ad20205ae354a6aa8eb292dbdf |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 421 |
| Best CPU time to get the best result obtained on this benchmark | 20120.6 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 200 |
| Number of constraints | 101 |
| Number of domains | 2 |
| Minimum domain size | 60 |
| Maximum domain size | 100 |
| Distribution of domain sizes | [{"size":60,"count":100},{"size":100,"count":100}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":100},{"degree":3,"count":100}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 100 |
| Distribution of constraint arities | [{"arity":3,"count":100},{"arity":100,"count":1}] |
| Number of extensional constraints | 100 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":100},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 416<instantiation> <list>c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[20] c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[30] c[31] c[32] c[33] c[34] c[35] c[36] c[37] c[38] c[39] c[40] c[41] c[42] c[43] c[44] c[45] c[46] c[47] c[48] c[49] c[50] c[51] c[52] c[53] c[54] c[55] c[56] c[57] c[58] c[59] c[60] c[61] c[62] c[63] c[64] c[65] c[66] c[67] c[68] c[69] c[70] c[71] c[72] c[73] c[74] c[75] c[76] c[77] c[78] c[79] c[80] c[81] c[82] c[83] c[84] c[85] c[86] c[87] c[88] c[89] c[90] c[91] c[92] c[93] c[94] c[95] c[96] c[97] c[98] c[99] d[0] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] d[20] d[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] d[30] d[31] d[32] d[33] d[34] d[35] d[36] d[37] d[38] d[39] d[40] d[41] d[42] d[43] d[44] d[45] d[46] d[47] d[48] d[49] d[50] d[51] d[52] d[53] d[54] d[55] d[56] d[57] d[58] d[59] d[60] d[61] d[62] d[63] d[64] d[65] d[66] d[67] d[68] d[69] d[70] d[71] d[72] d[73] d[74] d[75] d[76] d[77] d[78] d[79] d[80] d[81] d[82] d[83] d[84] d[85] d[86] d[87] d[88] d[89] d[90] d[91] d[92] d[93] d[94] d[95] d[96] d[97] d[98] d[99] </list> <values>4 5 11 18 20 27 39 28 33 29 30 34 31 24 40 41 43 46 53 63 65 62 56 54 10 3 2 12 15 21 23 25 16 22 17 13 14 6 26 36 35 37 32 38 49 51 55 61 66 67 72 83 86 93 98 97 81 77 69 71 74 78 76 82 85 92 89 95 99 91 80 79 88 90 94 96 87 84 75 60 70 64 73 68 58 59 57 52 50 42 48 47 45 44 19 7 8 9 0 1 3 5 6 1 4 4 4 2 2 2 1 4 3 5 4 3 1 4 6 4 5 4 1 24 9 1 4 3 4 1 4 6 5 4 2 2 6 12 3 2 6 3 2 6 1 2 4 3 1 3 8 2 5 4 3 11 2 18 3 2 4 2 4 1 4 3 2 9 4 5 1 4 3 1 7 5 3 6 9 5 4 4 3 8 1 4 3 1 5 3 2 2 2 11 9 4 1 6 1 1 </values> </instantiation>