| Name | TravellingSalesman/TravellingSalesman-m1-n20/ TravellingSalesman-20-30-18.xml |
| MD5SUM | 42f1d058d9b6109346b78f68a037a5c1 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 106 |
| Best CPU time to get the best result obtained on this benchmark | 2400.01 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 21 |
| Number of domains | 2 |
| Minimum domain size | 20 |
| Maximum domain size | 29 |
| Distribution of domain sizes | [{"size":20,"count":20},{"size":29,"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 |
|---|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267204 | SAT (TO) | 106 | 2400.01 | 2400.01 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260023 | SAT (TO) | 106 | 2400.04 | 2400 |
| Naxos 1.1.0 (complete) | 4253441 | SAT (TO) | 106 | 2400.11 | 2399.9 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253440 | ? (TO) | 2400.06 | 2400 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 106<instantiation type='solution' cost='-106'> <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[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[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] </list> <values>4 10 11 9 7 2 5 3 1 0 6 13 15 12 14 18 19 17 16 8 11 4 4 3 4 3 1 5 7 8 8 3 8 11 6 1 1 2 11 5 </values> </instantiation>