| Name | TravellingSalesman/ TravellingSalesman-40-30-00_c18.xml |
| MD5SUM | cd8c3cb9db38dc1b01c6d50a781e959c |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 171 |
| Best CPU time to get the best result obtained on this benchmark | 252.108 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 80 |
| Number of constraints | 41 |
| Number of domains | 2 |
| Minimum domain size | 33 |
| Maximum domain size | 40 |
| Distribution of domain sizes | [{"size":33,"count":40},{"size":40,"count":40}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":40},{"degree":3,"count":40}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 40 |
| Distribution of constraint arities | [{"arity":3,"count":40},{"arity":40,"count":1}] |
| Number of extensional constraints | 40 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":40},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| OscaR - Hybrid 2018-08-14 (complete) | 4310320 | SAT (TO) | 171 | 252.108 | 243.141 |
| cosoco 1.12 (complete) | 4302124 | SAT (TO) | 188 | 251.992 | 252.01 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302122 | SAT (TO) | 199 | 252.082 | 247.613 |
| Concrete 3.9.2 (complete) | 4302344 | SAT (TO) | 221 | 252.116 | 238.445 |
| Mistral-2.0 2018-08-01 (complete) | 4312740 | SAT (TO) | 234 | 252.005 | 252.01 |
| Concrete 3.9.2-SuperNG (complete) | 4302694 | SAT (TO) | 237 | 252.067 | 239.742 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309970 | SAT | 291 | 250.847 | 247.38 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312180 | SAT | 350 | 250.862 | 247.373 |
| Sat4j-CSP 2018-07-11 (complete) | 4302123 | SAT (TO) | 529 | 252.212 | 237.924 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 171<instantiation> <list> c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[20] c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[30] c[31] c[32] c[33] c[34] c[35] c[36] c[37] c[38] c[39] d[0] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] d[20] d[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] d[30] d[31] d[32] d[33] d[34] d[35] d[36] d[37] d[38] d[39] </list> <values> 30 6 1 0 2 4 5 7 8 3 9 10 16 11 15 13 14 12 17 18 23 22 24 19 20 25 28 27 21 26 36 38 37 34 32 33 39 35 31 29 17 4 7 2 1 2 4 1 4 3 8 7 4 6 3 1 4 3 2 3 3 5 4 4 4 5 2 7 5 7 12 3 2 4 1 6 6 3 1 1 </values> </instantiation>