Name | TravellingSalesman/TravellingSalesman-m1-n25/ TravellingSalesman-25-30-01.xml |
MD5SUM | c56376dbe966608a38512c6186d3b268 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 111 |
Best CPU time to get the best result obtained on this benchmark | 478.215 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 50 |
Number of constraints | 26 |
Number of domains | 2 |
Minimum domain size | 25 |
Maximum domain size | 31 |
Distribution of domain sizes | [{"size":25,"count":25},{"size":31,"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 |
---|---|---|---|---|---|
(reference) PicatSAT 2019-09-12 (complete) | 4407816 | OPT | 111 | 478.215 | 478.178 |
cosoco 2.0 (complete) | 4408873 | SAT (TO) | 169 | 2400.02 | 2399.8 |
cosoco 2.0 (complete) | 4397613 | SAT (TO) | 169 | 2400.08 | 2400.2 |
cosoco 2 (complete) | 4394808 | SAT (TO) | 169 | 2400.09 | 2400.4 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 111<instantiation> <list> d[] c[] </list> <values> 6 9 3 5 9 3 5 5 4 1 1 3 8 4 3 4 7 3 5 4 6 3 4 5 1 23 22 21 19 16 15 11 9 6 3 0 1 4 8 5 2 7 13 12 10 14 17 18 20 24 </values> </instantiation>