| 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 | 163 |
| Best CPU time to get the best result obtained on this benchmark | 303.843 |
| 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 |
|---|---|---|---|---|---|
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300452 | SAT | 163 | 303.843 | 300.511 |
| The dodo solver 2018-04-29 (complete) | 4300453 | SAT (TO) | 167 | 2520.1 | 2515.13 |
| MiniCPFever 2018-04-29 (complete) | 4300449 | SAT (TO) | 171 | 2520.11 | 2488.63 |
| cosoco 1.12 (complete) | 4300447 | SAT (TO) | 188 | 2519.78 | 2520.01 |
| GG's minicp 2018-04-29 (complete) | 4300448 | SAT (TO) | 221 | 2520.1 | 2504.63 |
| slowpoke 2018-04-29 (incomplete) | 4300450 | SAT (TO) | 257 | 2520.05 | 2506.32 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300451 | SAT (TO) | 261 | 2520.06 | 2479.33 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 163<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> 6 1 0 2 4 5 7 8 3 9 11 15 13 14 17 18 22 24 19 25 20 16 10 21 26 36 27 28 38 37 34 32 33 39 35 31 29 30 23 12 4 7 2 1 2 4 1 4 3 3 6 3 1 5 2 4 5 4 4 4 4 7 8 5 7 8 2 9 3 2 4 1 6 6 3 1 1 5 8 4 </values> </instantiation>