| Name | TravellingSalesman/TravellingSalesman-m1-n75/ TravellingSalesman-75-50-15.xml |
| MD5SUM | a46dbd65929ac2bb08e7dc57e3d27c25 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 375 |
| Best CPU time to get the best result obtained on this benchmark | 2400.03 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 150 |
| Number of constraints | 76 |
| Number of domains | 2 |
| Minimum domain size | 59 |
| Maximum domain size | 75 |
| Distribution of domain sizes | [{"size":59,"count":75},{"size":75,"count":75}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":75},{"degree":3,"count":75}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 75 |
| Distribution of constraint arities | [{"arity":3,"count":75},{"arity":75,"count":1}] |
| Number of extensional constraints | 75 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":75},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267212 | SAT (TO) | 375 | 2400.03 | 2400.01 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260031 | SAT (TO) | 375 | 2400.0901 | 2400 |
| Naxos 1.1.0 (complete) | 4253473 | ? (TO) | 2400.02 | 2399.8 | |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253472 | ? (TO) | 2400.03 | 2399.8 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 375<instantiation type='solution' cost='-375'> <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[20] c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[2] c[30] c[31] c[32] c[33] c[34] c[35] c[36] c[37] c[38] c[39] c[3] c[40] c[41] c[42] c[43] c[44] c[45] c[46] c[47] c[48] c[49] c[4] c[50] c[51] c[52] c[53] c[54] c[55] c[56] c[57] c[58] c[59] c[5] c[60] c[61] c[62] c[63] c[64] c[65] c[66] c[67] c[68] c[69] c[6] c[70] c[71] c[72] c[73] c[74] c[7] c[8] c[9] d[0] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] d[1] d[20] d[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] d[2] d[30] d[31] d[32] d[33] d[34] d[35] d[36] d[37] d[38] d[39] d[3] d[40] d[41] d[42] d[43] d[44] d[45] d[46] d[47] d[48] d[49] d[4] d[50] d[51] d[52] d[53] d[54] d[55] d[56] d[57] d[58] d[59] d[5] d[60] d[61] d[62] d[63] d[64] d[65] d[66] d[67] d[68] d[69] d[6] d[70] d[71] d[72] d[73] d[74] d[7] d[8] d[9] </list> <values>66 59 48 42 41 47 57 63 69 70 65 67 72 74 55 52 44 45 40 39 38 28 68 24 18 9 13 19 22 25 33 36 30 61 21 20 26 29 31 37 35 32 27 17 56 15 16 14 10 4 11 12 8 3 0 62 5 1 2 6 7 23 34 43 51 50 64 49 46 53 54 60 73 71 58 6 8 4 2 9 9 2 4 3 12 4 2 2 12 5 5 1 5 1 1 6 6 4 4 6 5 5 5 3 5 2 34 4 5 1 4 5 1 4 4 6 4 5 3 2 1 4 4 4 2 2 4 3 1 4 3 5 1 4 6 13 11 9 5 5 3 24 4 3 1 7 4 2 5 1 </values> </instantiation>