| Name | TravellingSalesman/TravellingSalesman-m1-n45/ TravellingSalesman-45-30-09.xml |
| MD5SUM | 8b7c2ee38e8603aaa2c4683b1141c0f0 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 185 |
| Best CPU time to get the best result obtained on this benchmark | 2400.05 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 90 |
| Number of constraints | 46 |
| Number of domains | 2 |
| Minimum domain size | 38 |
| Maximum domain size | 45 |
| Distribution of domain sizes | [{"size":38,"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-mini 1.1 (2017-07-29) (complete) | 4260027 | SAT (TO) | 185 | 2400.05 | 2400.3101 |
| cosoco-mini 1.12 (complete) | 4267208 | SAT (TO) | 185 | 2400.1001 | 2399.8999 |
| Naxos 1.1.0 (complete) | 4253457 | ? (TO) | 2400.02 | 2400.31 | |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253456 | ? (TO) | 2400.03 | 2399.9 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 185<instantiation type='solution' cost='-185'> <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>33 14 17 15 6 7 37 42 40 43 44 27 32 31 30 28 26 20 13 5 8 10 23 12 19 11 18 16 21 25 24 29 34 22 41 39 38 36 35 1 0 2 4 3 9 4 5 1 4 2 22 5 5 2 5 9 5 1 1 3 3 7 4 4 2 1 2 2 4 7 3 2 3 3 2 6 5 5 14 5 1 2 4 3 4 1 2 3 5 2 </values> </instantiation>