| Name | TravellingSalesman/TravellingSalesman-m1-n50/ TravellingSalesman-50-30-05.xml |
| MD5SUM | edc960599dc3680268fdb44af0bd56ea |
| 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.03 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 51 |
| Number of domains | 2 |
| Minimum domain size | 35 |
| Maximum domain size | 50 |
| Distribution of domain sizes | [{"size":35,"count":50},{"size":50,"count":50}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":50},{"degree":3,"count":50}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":3,"count":50},{"arity":50,"count":1}] |
| Number of extensional constraints | 50 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":50},{"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) | 4267210 | SAT (TO) | 185 | 2400.03 | 2399.8 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260029 | SAT (TO) | 185 | 2400.0901 | 2399.8999 |
| Naxos 1.1.0 (complete) | 4253463 | ? (TO) | 2400.03 | 2399.8 | |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253462 | ? (TO) | 2400.08 | 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: 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[45] c[46] c[47] c[48] c[49] 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[45] d[46] d[47] d[48] d[49] d[4] d[5] d[6] d[7] d[8] d[9] </list> <values>15 34 38 40 33 37 45 47 43 44 46 10 49 42 41 48 39 35 36 32 30 24 6 29 26 25 28 21 8 0 2 1 4 5 9 12 13 17 19 22 23 18 20 14 3 7 11 16 27 31 3 2 6 4 4 8 4 5 1 1 1 2 4 5 8 7 4 3 4 1 4 9 3 2 3 1 4 8 7 1 2 3 3 7 6 1 2 1 3 4 4 1 3 1 4 5 4 7 3 2 </values> </instantiation>