| Name | TravellingSalesman/TravellingSalesman-m1-n15/ TravellingSalesman-15-30-03.xml |
| MD5SUM | b4c2c5fda1e52dcd110cb3247db3b2b6 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 98 |
| Best CPU time to get the best result obtained on this benchmark | 65.7253 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 16 |
| Number of domains | 2 |
| Minimum domain size | 15 |
| Maximum domain size | 28 |
| Distribution of domain sizes | [{"size":15,"count":15},{"size":28,"count":15}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":15},{"degree":3,"count":15}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 15 |
| Distribution of constraint arities | [{"arity":3,"count":15},{"arity":15,"count":1}] |
| Number of extensional constraints | 15 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":15},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| (reference) PicatSAT 2019-09-12 (complete) | 4407807 | OPT | 98 | 65.7253 | 65.7179 |
| cosoco 2.0 (complete) | 4397548 | OPT | 98 | 317.207 | 317.215 |
| cosoco 2.0 (complete) | 4408808 | OPT | 98 | 318.301 | 318.307 |
| cosoco 2 (complete) | 4394799 | OPT | 98 | 320.868 | 320.928 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 98<instantiation> <list> d[] c[] </list> <values> 4 2 10 3 13 6 6 4 4 12 5 4 6 10 9 11 13 12 7 6 0 3 4 2 1 5 8 10 14 9 </values> </instantiation>