Name | TravellingSalesman/TravellingSalesman-m1-n20/ TravellingSalesman-20-30-05.xml |
MD5SUM | 6b55f0e9dc993e2546b868899e60f341 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 114 |
Best CPU time to get the best result obtained on this benchmark | 740.811 |
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 |
---|---|---|---|---|---|
(reference) PicatSAT 2019-09-12 (complete) | 4407797 | OPT | 114 | 740.811 | 740.794 |
cosoco 2.0 (complete) | 4408872 | SAT (TO) | 151 | 2400.04 | 2399.7 |
cosoco 2.0 (complete) | 4397612 | SAT (TO) | 151 | 2400.06 | 2400.2 |
cosoco 2 (complete) | 4394790 | SAT (TO) | 151 | 2400.12 | 2400.01 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 114<instantiation> <list> c[] d[] </list> <values> 10 12 13 14 17 19 18 16 15 3 2 6 9 8 11 5 0 1 4 7 4 6 1 7 8 16 6 7 14 8 2 3 1 2 9 4 2 7 5 2 </values> </instantiation>