Name | TravellingSalesman/TravellingSalesman-m1-n40/ TravellingSalesman-40-30-12.xml |
MD5SUM | e748ab835a8846d33987f42bf2708adf |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT TO |
Best value of the objective obtained on this benchmark | 315 |
Best CPU time to get the best result obtained on this benchmark | 2400.01 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 80 |
Number of constraints | 41 |
Number of domains | 2 |
Minimum domain size | 37 |
Maximum domain size | 40 |
Distribution of domain sizes | [{"size":37,"count":40},{"size":40,"count":40}] |
Minimum variable degree | 2 |
Maximum variable degree | 3 |
Distribution of variable degrees | [{"degree":2,"count":40},{"degree":3,"count":40}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 40 |
Distribution of constraint arities | [{"arity":3,"count":40},{"arity":40,"count":1}] |
Number of extensional constraints | 40 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":40},{"type":"allDifferent","count":1}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
cosoco 2.0 (complete) | 4408857 | SAT (TO) | 315 | 2400.01 | 2399.7 |
cosoco 2.0 (complete) | 4397597 | SAT (TO) | 315 | 2400.01 | 2399.8 |
cosoco 2 (complete) | 4394805 | SAT (TO) | 315 | 2400.03 | 2400.01 |
(reference) PicatSAT 2019-09-12 (complete) | 4407813 | ? (TO) | 2400.01 | 2399.8 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 315<instantiation type='solution' cost='315'> <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[20] c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[2] c[30] c[31] c[32] c[33] c[34] c[35] c[36] c[37] c[38] c[39] c[3] c[4] c[5] c[6] c[7] c[8] c[9] d[0] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] d[1] d[20] d[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] d[2] d[30] d[31] d[32] d[33] d[34] d[35] d[36] d[37] d[38] d[39] d[3] d[4] d[5] d[6] d[7] d[8] d[9] </list> <values>6 24 17 19 18 30 34 36 37 23 7 13 27 20 21 16 9 38 25 22 11 35 0 28 29 26 39 33 32 31 15 3 2 1 4 5 14 12 8 10 6 6 1 3 7 7 1 1 10 11 19 24 2 1 4 9 24 9 1 8 17 8 4 5 8 9 9 4 3 13 12 4 5 4 6 21 8 5 4 12 </values> </instantiation>