| Name | TravellingSalesman/ TravellingSalesman-50-30-00_c18.xml |
| MD5SUM | 80c5a80d7c962cf143a1b6c53ca701c2 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 207 |
| Best CPU time to get the best result obtained on this benchmark | 20057.9 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 51 |
| Number of domains | 2 |
| Minimum domain size | 33 |
| Maximum domain size | 50 |
| Distribution of domain sizes | [{"size":33,"count":50},{"size":50,"count":50}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":50},{"degree":3,"count":50}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":3,"count":50},{"arity":50,"count":1}] |
| Number of extensional constraints | 50 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":50},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297444 | SAT (TO) | 207 | 20057.9 | 2520.12 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291031 | SAT (TO) | 817 | 19978.8 | 2520.18 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308800 | SAT (TO) | 824 | 19991.3 | 2520.25 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 207<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] c[20] c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[30] c[31] c[32] c[33] c[34] c[35] c[36] c[37] c[38] c[39] c[40] c[41] c[42] c[43] c[44] c[45] c[46] c[47] c[48] c[49] 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] d[20] d[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] d[30] d[31] d[32] d[33] d[34] d[35] d[36] d[37] d[38] d[39] d[40] d[41] d[42] d[43] d[44] d[45] d[46] d[47] d[48] d[49] </list> <values>36 37 33 26 27 32 30 31 34 38 39 40 44 41 42 43 47 48 49 45 46 20 19 17 1 7 14 12 16 23 24 25 0 2 5 6 8 9 13 15 10 4 3 21 22 18 11 28 29 35 2 5 4 4 8 5 3 1 4 1 2 3 5 1 4 2 3 9 15 7 23 3 1 11 4 2 2 2 3 1 1 12 2 1 2 4 1 3 1 3 2 1 7 2 2 4 8 2 4 5 </values> </instantiation>