| Name | TravellingSalesman/ TravellingSalesman-20-30-00_c18.xml |
| MD5SUM | 22e303206e5b0ea869a7ab153bbd8d22 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 104 |
| Best CPU time to get the best result obtained on this benchmark | 20080 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 21 |
| Number of domains | 2 |
| Minimum domain size | 20 |
| Maximum domain size | 32 |
| Distribution of domain sizes | [{"size":20,"count":20},{"size":32,"count":20}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":20},{"degree":3,"count":20}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 20 |
| Distribution of constraint arities | [{"arity":3,"count":20},{"arity":20,"count":1}] |
| Number of extensional constraints | 20 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":20},{"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) | 4297438 | SAT (TO) | 104 | 20080 | 2520.12 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291025 | SAT (TO) | 126 | 19933.8 | 2520.28 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308794 | SAT (TO) | 140 | 19948.2 | 2520.28 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 104<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] 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] </list> <values>0 2 3 5 6 8 10 12 9 11 18 19 17 16 14 13 15 7 4 1 2 2 4 6 8 4 6 7 5 7 12 4 4 3 1 1 9 8 4 7 </values> </instantiation>