Name | TravellingSalesman/TravellingSalesman-m1-n30/ TravellingSalesman-30-30-10.xml |
MD5SUM | 5b2f64ce8ea12bd170df7a7ab6f64ceb |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT TO |
Best value of the objective obtained on this benchmark | 225 |
Best CPU time to get the best result obtained on this benchmark | 2400.01 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 60 |
Number of constraints | 31 |
Number of domains | 2 |
Minimum domain size | 30 |
Maximum domain size | 34 |
Distribution of domain sizes | [{"size":30,"count":30},{"size":34,"count":30}] |
Minimum variable degree | 2 |
Maximum variable degree | 3 |
Distribution of variable degrees | [{"degree":2,"count":30},{"degree":3,"count":30}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 30 |
Distribution of constraint arities | [{"arity":3,"count":30},{"arity":30,"count":1}] |
Number of extensional constraints | 30 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":30},{"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) | 4408852 | SAT (TO) | 225 | 2400.01 | 2399.8 |
cosoco 2.0 (complete) | 4397592 | SAT (TO) | 225 | 2400.03 | 2399.8 |
cosoco 2 (complete) | 4394809 | SAT (TO) | 225 | 2400.08 | 2400.11 |
(reference) PicatSAT 2019-09-12 (complete) | 4407817 | ? (TO) | 2400.02 | 2399.7 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 225<instantiation type='solution' cost='225'> <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[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[3] d[4] d[5] d[6] d[7] d[8] d[9] </list> <values>4 19 20 27 12 13 14 15 22 29 23 7 21 18 9 1 25 28 26 24 6 2 8 5 3 0 10 11 16 17 3 4 6 18 8 2 3 9 7 6 3 4 4 12 11 26 4 10 2 23 25 2 4 2 3 13 4 2 2 3 </values> </instantiation>