| Name | TravellingSalesman/TravellingSalesman-m1-n30/ TravellingSalesman-30-30-19.xml |
| MD5SUM | a6469c0d47f71dcca9bcaaa451655f38 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 126 |
| Best CPU time to get the best result obtained on this benchmark | 2520.08 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 60 |
| Number of constraints | 31 |
| Number of domains | 2 |
| Minimum domain size | 30 |
| Maximum domain size | 33 |
| Distribution of domain sizes | [{"size":30,"count":30},{"size":33,"count":30}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":30},{"degree":3,"count":30}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 30 |
| Distribution of constraint arities | [{"arity":3,"count":30},{"arity":30,"count":1}] |
| Number of extensional constraints | 30 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":30},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 126<instantiation cost = '126'> <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] 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] </list> <values> 3 6 2 4 7 8 9 15 16 26 23 22 20 18 14 19 29 28 27 25 24 21 17 11 12 13 10 5 0 1 4 4 17 6 6 2 6 4 6 1 1 3 2 4 6 6 2 2 2 1 2 6 3 2 5 2 12 4 2 3 </values> </instantiation>