| Name | TravellingSalesman/TravellingSalesman-m1-n20/ TravellingSalesman-20-30-04.xml |
| MD5SUM | b71521ce1917b31a1de4920ce1e04ad3 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 122 |
| Best CPU time to get the best result obtained on this benchmark | 389.928 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 21 |
| Number of domains | 2 |
| Minimum domain size | 20 |
| Maximum domain size | 31 |
| Distribution of domain sizes | [{"size":20,"count":20},{"size":31,"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 |
|---|---|---|---|---|---|
| (reference) PicatSAT 2019-09-12 (complete) | 4407795 | OPT | 122 | 389.928 | 389.939 |
| cosoco 2.0 (complete) | 4408860 | SAT (TO) | 150 | 2400.02 | 2399.8 |
| cosoco 2 (complete) | 4394788 | SAT (TO) | 150 | 2400.08 | 2400.11 |
| cosoco 2.0 (complete) | 4397600 | SAT (TO) | 150 | 2400.1 | 2400.3 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 122<instantiation> <list> d[] c[] </list> <values> 6 4 4 3 4 8 6 4 2 8 8 10 13 14 7 2 4 6 5 4 2 7 8 10 12 14 9 13 15 16 19 17 18 11 1 5 6 4 3 0 </values> </instantiation>