| Name | TravellingSalesman/TravellingSalesman-m1-n15/ TravellingSalesman-15-30-01.xml |
| MD5SUM | 47b15046b8b091c4bf04c3c6cda399a9 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 106 |
| Best CPU time to get the best result obtained on this benchmark | 81.0792 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 16 |
| Number of domains | 2 |
| Minimum domain size | 15 |
| Maximum domain size | 24 |
| Distribution of domain sizes | [{"size":15,"count":15},{"size":24,"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) | 4407803 | OPT | 106 | 81.0792 | 81.097 |
| cosoco 2.0 (complete) | 4397523 | OPT | 106 | 456.583 | 456.594 |
| cosoco 2.0 (complete) | 4408783 | OPT | 106 | 458.206 | 458.149 |
| cosoco 2 (complete) | 4394795 | OPT | 106 | 462.975 | 462.921 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 106<instantiation> <list> d[] c[] </list> <values> 9 9 9 7 11 5 14 4 5 7 5 4 6 7 4 3 7 11 14 13 12 10 2 1 5 9 8 6 4 0 </values> </instantiation>