| Name | TravellingSalesman/ TravellingSalesman-15-30-00_c18.xml |
| MD5SUM | 0f9f8d62bc132272af22ef8ddad99d7d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 93 |
| Best CPU time to get the best result obtained on this benchmark | 249.846 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 16 |
| Number of domains | 2 |
| Minimum domain size | 15 |
| Maximum domain size | 31 |
| Distribution of domain sizes | [{"size":15,"count":15},{"size":31,"count":15}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":15},{"degree":3,"count":15}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 15 |
| Distribution of constraint arities | [{"arity":3,"count":15},{"arity":15,"count":1}] |
| Number of extensional constraints | 15 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":15},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309965 | SAT | 93 | 249.846 | 247.358 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312175 | SAT | 93 | 250.014 | 247.378 |
| cosoco 1.12 (complete) | 4302103 | SAT (TO) | 93 | 251.969 | 252.009 |
| Mistral-2.0 2018-08-01 (complete) | 4312733 | SAT (TO) | 93 | 252.006 | 252.01 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302101 | SAT (TO) | 93 | 252.03 | 248.313 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310315 | SAT (TO) | 93 | 252.085 | 245.027 |
| Concrete 3.9.2-SuperNG (complete) | 4302689 | SAT (TO) | 93 | 252.102 | 237.235 |
| Concrete 3.9.2 (complete) | 4302339 | SAT (TO) | 93 | 252.131 | 236.736 |
| Sat4j-CSP 2018-07-11 (complete) | 4302102 | SAT (TO) | 143 | 252.132 | 247.428 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 93<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] 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] </list> <values> 0 1 4 6 11 12 13 14 10 8 9 7 5 3 2 7 4 8 8 1 8 15 7 5 9 4 8 5 2 2 </values> </instantiation>