| Name | TravellingSalesman/TravellingSalesman-xcsp2-s20a4/ TravellingSalesman-4-20-075-a4_X2.xml |
| MD5SUM | 0d46043221e63cab3e036ad7daf2b407 |
| 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 | 9.14787 |
| 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":180,"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 19.06.16 (complete) | 4391808 | SAT | 9.14787 | 9.15225 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407820 | SAT | 24.5979 | 24.5961 |
| NACRE 1.0.5-Hybrid (complete) | 4391408 | SAT | 39.3588 | 39.3727 |
| NACRE 1.0.5 (complete) | 4391608 | SAT | 158.664 | 158.684 |
| cosoco 2.0 (complete) | 4408548 | SAT | 174.218 | 174.23 |
| cosoco 2 (complete) | 4390008 | SAT | 175.219 | 175.206 |
| cosoco 2.0 (complete) | 4397288 | SAT | 176.071 | 176.095 |
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> 179 0 4 1 12 19 9 11 14 16 7 18 2 17 6 10 20 15 5 13 8 3 16 17 2 1 11 1 7 4 16 11 3 2 12 4 3 4 15 8 18 24 33 35 36 47 48 55 59 75 86 89 91 103 107 110 114 129 137 155 179 </values> </instantiation>