| Name | TravellingSalesman/TravellingSalesman-m1-n45/ TravellingSalesman-45-30-17.xml |
| MD5SUM | 369093f5c07699bd32757068998f5546 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 298 |
| Best CPU time to get the best result obtained on this benchmark | 2400.03 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 90 |
| Number of constraints | 46 |
| Number of domains | 2 |
| Minimum domain size | 36 |
| Maximum domain size | 45 |
| Distribution of domain sizes | [{"size":36,"count":45},{"size":45,"count":45}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":45},{"degree":3,"count":45}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 45 |
| Distribution of constraint arities | [{"arity":3,"count":45},{"arity":45,"count":1}] |
| Number of extensional constraints | 45 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":45},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 2.0 (complete) | 4408835 | SAT (TO) | 298 | 2400.03 | 2400.01 |
| cosoco 2.0 (complete) | 4397575 | SAT (TO) | 298 | 2400.03 | 2400.5 |
| cosoco 2 (complete) | 4394792 | SAT (TO) | 298 | 2400.07 | 2400.11 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407800 | ? (TO) | 2400.02 | 2400.4 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 298<instantiation type='solution' cost='298'> <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[4] c[5] c[6] 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[4] d[5] d[6] d[7] d[8] d[9] </list> <values>17 37 29 25 30 41 44 43 35 33 0 27 38 36 42 31 22 20 14 15 11 8 26 6 1 5 23 19 28 34 39 40 32 3 24 21 12 10 13 7 16 4 9 2 18 7 7 5 4 8 2 2 6 1 21 27 1 7 4 8 6 3 7 4 1 2 2 27 4 2 12 4 8 3 2 2 4 5 7 1 8 1 3 3 5 9 4 13 25 11 </values> </instantiation>