| Name | TravellingSalesman/ TravellingSalesman-50-30-00_c18.xml |
| MD5SUM | 80c5a80d7c962cf143a1b6c53ca701c2 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 190 |
| Best CPU time to get the best result obtained on this benchmark | 252.013 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 51 |
| Number of domains | 2 |
| Minimum domain size | 33 |
| Maximum domain size | 50 |
| Distribution of domain sizes | [{"size":33,"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 1.12 (complete) | 4302130 | SAT (TO) | 190 | 252.013 | 252.01 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310322 | SAT (TO) | 197 | 252.067 | 242.146 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302128 | SAT (TO) | 210 | 252.11 | 247.512 |
| Concrete 3.9.2 (complete) | 4302346 | SAT (TO) | 259 | 252.127 | 240.044 |
| Concrete 3.9.2-SuperNG (complete) | 4302696 | SAT (TO) | 262 | 252.065 | 238.734 |
| Mistral-2.0 2018-08-01 (complete) | 4312742 | SAT (TO) | 273 | 251.997 | 252.01 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312182 | SAT | 375 | 251.119 | 247.363 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309972 | SAT | 399 | 251.064 | 247.376 |
| Sat4j-CSP 2018-07-11 (complete) | 4302129 | ? (TO) | 252.076 | 226.638 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 190<instantiation type='solution' cost='190'> <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>7 44 49 42 41 43 47 48 45 46 35 14 29 28 36 37 33 19 17 20 8 9 12 15 13 3 4 10 11 18 22 21 27 2 26 32 30 34 31 25 24 23 16 1 5 6 0 39 38 40 2 6 6 1 4 2 3 5 7 7 4 2 2 7 2 5 11 1 3 4 1 4 4 1 3 1 2 8 4 2 2 4 4 1 4 5 4 1 3 1 1 3 8 4 2 4 20 1 1 3 </values> </instantiation>