Name | TravellingSalesman/TravellingSalesman-m1-n20/ TravellingSalesman-20-30-14.xml |
MD5SUM | ce3a169279db7bbca720b415ad84d08c |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 97 |
Best CPU time to get the best result obtained on this benchmark | 258.185 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 40 |
Number of constraints | 21 |
Number of domains | 2 |
Minimum domain size | 20 |
Maximum domain size | 30 |
Distribution of domain sizes | [{"size":20,"count":20},{"size":30,"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) | 4407796 | OPT | 97 | 258.185 | 258.184 |
cosoco 2.0 (complete) | 4397619 | SAT (TO) | 116 | 2400.02 | 2400.11 |
cosoco 2.0 (complete) | 4408879 | SAT (TO) | 116 | 2400.04 | 2400.01 |
cosoco 2 (complete) | 4394789 | SAT (TO) | 116 | 2400.04 | 2400.2 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 97<instantiation> <list> c[] d[] </list> <values> 6 3 2 4 5 8 9 11 12 17 18 19 16 13 14 15 10 7 0 1 6 5 2 2 3 7 2 2 6 1 6 4 4 1 6 7 10 8 6 9 </values> </instantiation>