| Name | TravellingSalesman/TravellingSalesman-xcsp2-s20a4/ TravellingSalesman-4-20-727-a4_X2.xml |
| MD5SUM | feda79726080e93715556435cff6944b |
| 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 | 18.608999 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 61 |
| Number of constraints | 228 |
| 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":216,"count":19},{"size":1001,"count":20}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 208 |
| Distribution of variable degrees | [{"degree":1,"count":2},{"degree":2,"count":37},{"degree":19,"count":1},{"degree":20,"count":18},{"degree":37,"count":1},{"degree":190,"count":1},{"degree":208,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 4 |
| Distribution of constraint arities | [{"arity":2,"count":1},{"arity":3,"count":20},{"arity":4,"count":207}] |
| Number of extensional constraints | 228 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":228}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-06-30 (complete) | 4253482 | SAT | 18.5939 | 18.596 |
| miniBTD 2017-08-10 (complete) | 4265054 | SAT | 18.608999 | 18.6106 |
| cosoco-mini 1.12 (complete) | 4267495 | SAT | 26.093901 | 26.1008 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253483 | SAT | 26.4656 | 26.4759 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260314 | SAT | 26.8484 | 26.9454 |
| Naxos 1.1.0 (complete) | 4253484 | SAT | 1833.55 | 1833.58 |
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> 215 0 19 13 6 9 10 2 8 1 7 14 18 20 11 12 3 5 15 16 17 4 21 3 24 1 23 4 28 12 27 4 12 10 4 13 5 8 3 5 4 4 24 48 49 72 76 104 116 143 147 159 169 173 186 191 199 202 207 211 215 </values> </instantiation>