| Name | TravellingSalesman/ TravellingSalesman-75-50-00_c18.xml |
| MD5SUM | 7fcf74bccc1d4f399a3457b4fd80f100 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 357 |
| Best CPU time to get the best result obtained on this benchmark | 252.005 |
| 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 1.12 (complete) | 4302115 | SAT (TO) | 357 | 252.005 | 252.01 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302113 | SAT (TO) | 408 | 252.103 | 246.613 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310323 | SAT (TO) | 440 | 252.078 | 243.029 |
| Concrete 3.9.2 (complete) | 4302347 | SAT (TO) | 626 | 252.08 | 237.74 |
| Concrete 3.9.2-SuperNG (complete) | 4302697 | SAT (TO) | 647 | 252.053 | 235.044 |
| Mistral-2.0 2018-08-01 (complete) | 4312737 | SAT (TO) | 731 | 251.979 | 252.01 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312183 | SAT | 1011 | 251.504 | 247.366 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309973 | SAT | 1237 | 251.665 | 247.367 |
| Sat4j-CSP 2018-07-11 (complete) | 4302114 | ? (TO) | 260.179 | 100.945 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 357<instantiation type='solution' cost='357'> <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>62 74 69 64 56 55 54 50 51 52 46 66 42 32 36 35 30 25 15 18 19 16 67 14 9 7 5 13 12 11 21 26 28 68 29 31 34 38 41 40 43 39 37 33 63 24 27 23 22 20 17 10 8 4 3 60 2 6 0 1 59 72 44 49 48 45 61 53 47 58 57 65 70 71 73 2 6 4 7 1 1 2 3 3 3 4 3 4 3 2 3 4 12 5 4 3 5 5 1 2 6 4 2 7 7 4 4 1 3 3 7 1 2 1 9 2 2 1 6 3 5 7 1 2 4 8 7 3 2 1 2 4 8 7 38 11 25 4 1 2 6 6 4 5 5 4 1 3 6 8 </values> </instantiation>