Name | TravellingSalesman/TravellingSalesman-m1-n30/ TravellingSalesman-30-30-18.xml |
MD5SUM | 16e7a4452edd8ccb673a436dbd81290a |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 137 |
Best CPU time to get the best result obtained on this benchmark | 2400.02 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 60 |
Number of constraints | 31 |
Number of domains | 2 |
Minimum domain size | 30 |
Maximum domain size | 30 |
Distribution of domain sizes | [{"size":30,"count":60}] |
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-mini 1.1 (2017-07-29) (complete) | 4260024 | SAT (TO) | 137 | 2400.02 | 2400.21 |
cosoco-mini 1.12 (complete) | 4267205 | SAT (TO) | 137 | 2400.0601 | 2399.8999 |
Naxos 1.1.0 (complete) | 4253475 | SAT (TO) | 154 | 2400.01 | 2400 |
cosoco-mini 1.1 (2017-06-27) (complete) | 4253474 | ? (TO) | 2400.09 | 2400.5 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 137<instantiation type='solution' cost='-137'> <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>15 5 3 4 1 0 7 6 11 9 14 2 20 22 21 24 29 23 27 28 26 25 10 13 18 19 17 16 12 8 10 2 1 6 7 6 2 4 5 4 9 7 4 3 3 5 16 6 1 1 2 11 1 5 4 4 1 3 3 1 </values> </instantiation>