| Name | TravellingSalesman/TravellingSalesman-xcsp2-s25/ TravellingSalesman-25-066_X2.xml |
| MD5SUM | 09321018be6bfcc628ddab34eddf7071 |
| 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 | 2.2272699 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 76 |
| Number of constraints | 350 |
| Number of domains | 5 |
| Minimum domain size | 1 |
| Maximum domain size | 1001 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":25,"count":25},{"size":121,"count":24},{"size":1001,"count":25}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 25 |
| Distribution of variable degrees | [{"degree":1,"count":2},{"degree":2,"count":49},{"degree":25,"count":25}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":2,"count":325},{"arity":3,"count":25}] |
| Number of extensional constraints | 350 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":350}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267497 | SAT | 0.087825999 | 0.088808998 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260316 | SAT | 0.087921999 | 0.186131 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253449 | SAT | 0.088141 | 0.0887139 |
| miniBTD 2017-06-30 (complete) | 4253448 | SAT | 2.17014 | 2.17166 |
| miniBTD 2017-08-10 (complete) | 4265056 | SAT | 2.2272699 | 2.22857 |
| Naxos 1.1.0 (complete) | 4253450 | SAT | 33.9502 | 33.9552 |
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] x[20] x[21] x[22] x[23] x[24] 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] y[20] y[21] y[22] y[23] y[24] 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] z[19] z[20] z[21] z[22] z[23] </list> <values>120 0 22 6 7 19 16 2 4 14 8 21 25 17 18 23 10 12 3 13 9 15 5 1 24 20 11 0 1 1 0 3 14 5 3 1 1 3 3 1 5 2 1 3 0 4 0 16 4 8 35 6 1 2 2 5 19 24 27 28 29 32 35 36 41 43 44 47 47 51 51 67 71 79 114 120 </values> </instantiation>