| Name | TravellingSalesman/ TravellingSalesman-25-30-00_c18.xml |
| MD5SUM | fffb7bc75ae44a730e23d85d48ed452e |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 113 |
| Best CPU time to get the best result obtained on this benchmark | 252.104 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 26 |
| Number of domains | 2 |
| Minimum domain size | 25 |
| Maximum domain size | 32 |
| Distribution of domain sizes | [{"size":25,"count":25},{"size":32,"count":25}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":25},{"degree":3,"count":25}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 25 |
| Distribution of constraint arities | [{"arity":3,"count":25},{"arity":25,"count":1}] |
| Number of extensional constraints | 25 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":25},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| OscaR - Hybrid 2018-08-14 (complete) | 4310317 | SAT (TO) | 113 | 252.104 | 244.133 |
| Concrete 3.9.2 (complete) | 4302341 | SAT (TO) | 113 | 252.123 | 236.535 |
| Concrete 3.9.2-SuperNG (complete) | 4302691 | SAT (TO) | 115 | 252.114 | 239.332 |
| cosoco 1.12 (complete) | 4302106 | SAT (TO) | 118 | 252.037 | 252.009 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302104 | SAT (TO) | 121 | 252.055 | 247.315 |
| Mistral-2.0 2018-08-01 (complete) | 4312734 | SAT (TO) | 129 | 252.016 | 252.01 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309967 | SAT | 175 | 250.432 | 247.359 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312177 | SAT | 191 | 250.563 | 247.37 |
| Sat4j-CSP 2018-07-11 (complete) | 4302105 | SAT (TO) | 284 | 252.113 | 245.337 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 113<instantiation> <list> c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[20] c[21] c[22] c[23] c[24] d[0] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] d[20] d[21] d[22] d[23] d[24] </list> <values> 17 10 5 1 0 2 3 4 6 7 8 11 14 12 9 13 15 16 22 24 23 21 20 18 19 8 8 4 7 2 1 2 4 5 1 8 4 4 4 6 5 5 8 12 3 2 4 3 2 1 </values> </instantiation>