| Name | TravellingSalesman/ TravellingSalesman-35-30-00_c18.xml |
| MD5SUM | 558ee623558ef43f0bbab0563f00ef08 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 148 |
| Best CPU time to get the best result obtained on this benchmark | 2520.11 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 70 |
| Number of constraints | 36 |
| Number of domains | 2 |
| Minimum domain size | 33 |
| Maximum domain size | 35 |
| Distribution of domain sizes | [{"size":33,"count":35},{"size":35,"count":35}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":35},{"degree":3,"count":35}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 35 |
| Distribution of constraint arities | [{"arity":3,"count":35},{"arity":35,"count":1}] |
| Number of extensional constraints | 35 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":35},{"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: 148<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] 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] </list> <values> 21 18 10 3 8 7 5 4 2 0 1 6 11 16 17 13 12 14 22 19 15 9 20 23 24 32 34 33 30 28 29 31 27 25 26 4 6 4 4 1 4 2 1 2 7 4 4 3 2 6 1 3 9 4 4 7 8 5 5 8 12 3 2 4 1 5 3 1 1 8 </values> </instantiation>