| Name | TravellingSalesman/ TravellingSalesman-25-30-00_c18.xml |
| MD5SUM | fffb7bc75ae44a730e23d85d48ed452e |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 119 |
| Best CPU time to get the best result obtained on this benchmark | 20061.4 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 26 |
| Number of domains | 2 |
| Minimum domain size | 25 |
| Maximum domain size | 32 |
| Distribution of domain sizes | [{"size":25,"count":25},{"size":32,"count":25}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":25},{"degree":3,"count":25}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 25 |
| Distribution of constraint arities | [{"arity":3,"count":25},{"arity":25,"count":1}] |
| Number of extensional constraints | 25 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":25},{"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) | 4297439 | SAT (TO) | 119 | 20061.4 | 2520.1 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308795 | SAT (TO) | 259 | 19960 | 2520.38 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291026 | SAT (TO) | 259 | 19960.5 | 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: 119<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] 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] </list> <values>1 5 10 19 17 18 20 21 23 24 14 16 22 15 13 9 12 11 6 4 7 8 3 2 0 4 8 9 1 1 3 4 2 3 11 6 8 7 5 6 4 4 9 4 4 1 5 1 2 7 </values> </instantiation>