Name | TravellingSalesman/TravellingSalesman-m1-n45/ TravellingSalesman-45-30-01.xml |
MD5SUM | 9f6d2eef465d4ced4ecc5e4d4ab5c0f8 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT TO |
Best value of the objective obtained on this benchmark | 330 |
Best CPU time to get the best result obtained on this benchmark | 2400.02 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 90 |
Number of constraints | 46 |
Number of domains | 2 |
Minimum domain size | 35 |
Maximum domain size | 45 |
Distribution of domain sizes | [{"size":35,"count":45},{"size":45,"count":45}] |
Minimum variable degree | 2 |
Maximum variable degree | 3 |
Distribution of variable degrees | [{"degree":2,"count":45},{"degree":3,"count":45}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 45 |
Distribution of constraint arities | [{"arity":3,"count":45},{"arity":45,"count":1}] |
Number of extensional constraints | 45 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":45},{"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) | 4408854 | SAT (TO) | 330 | 2400.02 | 2400.11 |
cosoco 2 (complete) | 4394791 | SAT (TO) | 330 | 2400.03 | 2399.8 |
cosoco 2.0 (complete) | 4397594 | SAT (TO) | 330 | 2400.09 | 2400.11 |
(reference) PicatSAT 2019-09-12 (complete) | 4407799 | ? (TO) | 2400.05 | 2399.9 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 330<instantiation type='solution' cost='330'> <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[40] c[41] c[42] c[43] c[44] 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[40] d[41] d[42] d[43] d[44] d[4] d[5] d[6] d[7] d[8] d[9] </list> <values>19 25 21 5 0 7 26 17 16 24 33 14 36 37 31 29 28 9 32 40 44 38 10 27 30 12 1 8 35 39 43 42 41 2 34 4 13 20 18 6 3 15 11 23 22 2 6 10 4 6 11 4 2 9 8 4 4 1 7 2 10 11 15 6 8 6 22 5 5 13 6 5 18 3 16 1 6 15 4 28 7 5 7 2 3 8 3 6 3 3 </values> </instantiation>