| Name | TravellingSalesman/TravellingSalesman-xcsp2-s20/ TravellingSalesman-20-076_X2.xml |
| MD5SUM | 63d95fcac4968a6897becae9cdc29854 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 20.472 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 61 |
| Number of constraints | 230 |
| Number of domains | 5 |
| Minimum domain size | 1 |
| Maximum domain size | 1001 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":20,"count":20},{"size":183,"count":19},{"size":1001,"count":20}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 20 |
| Distribution of variable degrees | [{"degree":1,"count":2},{"degree":2,"count":39},{"degree":20,"count":20}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":2,"count":210},{"arity":3,"count":20}] |
| Number of extensional constraints | 230 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":230}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-08-10 (complete) | 4265051 | SAT | 4.0778499 | 4.07898 |
| miniBTD 2017-06-30 (complete) | 4253442 | SAT | 4.18266 | 4.18389 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253443 | SAT | 20.4546 | 20.4568 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260311 | SAT | 20.472 | 20.538799 |
| cosoco-mini 1.12 (complete) | 4267492 | SAT | 20.477501 | 20.485001 |
| Naxos 1.1.0 (complete) | 4253444 | SAT | 126.457 | 126.467 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type="solution"> <list> w3 w4 x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8] y[9] y[10] y[11] y[12] y[13] y[14] y[15] y[16] y[17] y[18] y[19] z[0] z[1] z[2] z[3] z[4] z[5] z[6] z[7] z[8] z[9] z[10] z[11] z[12] z[13] z[14] z[15] z[16] z[17] z[18] </list> <values> 182 0 5 10 2 15 13 7 19 9 14 8 12 3 20 18 16 17 1 4 11 6 2 5 3 3 24 18 17 11 5 8 13 22 26 3 3 4 0 3 4 8 7 10 13 37 55 72 83 88 96 109 131 157 160 163 167 167 170 174 182 </values> </instantiation>