| Name | TravellingSalesman/TravellingSalesman-m1-n20/ TravellingSalesman-20-30-09.xml |
| MD5SUM | 3778b76dec94085d2dd964afc4e92a91 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 120 |
| Best CPU time to get the best result obtained on this benchmark | 247.562 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 21 |
| Number of domains | 2 |
| Minimum domain size | 20 |
| Maximum domain size | 34 |
| Distribution of domain sizes | [{"size":20,"count":20},{"size":34,"count":20}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":20},{"degree":3,"count":20}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 20 |
| Distribution of constraint arities | [{"arity":3,"count":20},{"arity":20,"count":1}] |
| Number of extensional constraints | 20 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":20},{"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: 120<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] 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] </list> <values> 9 7 1 0 2 5 4 10 16 17 15 18 19 14 13 12 11 6 3 8 3 9 3 2 3 2 5 14 2 5 5 18 10 3 7 4 11 2 5 7 </values> </instantiation>