| Name | TravellingSalesman/ TravellingSalesman-20-30-00_c18.xml |
| MD5SUM | 22e303206e5b0ea869a7ab153bbd8d22 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 104 |
| Best CPU time to get the best result obtained on this benchmark | 252.109 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 21 |
| Number of domains | 2 |
| Minimum domain size | 20 |
| Maximum domain size | 32 |
| Distribution of domain sizes | [{"size":20,"count":20},{"size":32,"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 |
|---|---|---|---|---|---|
| Mistral-2.0 2018-08-01 (complete) | 4312743 | SAT (TO) | 104 | 252.003 | 252.01 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302131 | SAT (TO) | 104 | 252.109 | 247.512 |
| Concrete 3.9.2-SuperNG (complete) | 4302690 | SAT (TO) | 104 | 252.126 | 239.043 |
| Concrete 3.9.2 (complete) | 4302340 | SAT (TO) | 104 | 252.133 | 235.534 |
| cosoco 1.12 (complete) | 4302133 | SAT (TO) | 108 | 252.008 | 252.01 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310316 | SAT (TO) | 116 | 252.028 | 242.126 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309966 | SAT | 119 | 250.088 | 247.36 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312176 | SAT | 122 | 250.087 | 247.363 |
| Sat4j-CSP 2018-07-11 (complete) | 4302132 | SAT (TO) | 203 | 252.15 | 246.03 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 104<instantiation type="solution"> <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] 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] </list> <values> 6 5 3 2 0 1 4 7 13 15 14 16 17 19 18 11 9 12 10 8 6 4 2 2 7 4 8 8 1 2 3 4 4 12 7 5 7 6 4 8 </values> </instantiation>