| Name | GraphColoring/ GraphColoring-queen5-5_c18.xml |
| MD5SUM | e12c8a42b46a63e49e1504c0c9e3cd93 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 4 |
| Best CPU time to get the best result obtained on this benchmark | 0.031522 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 25 |
| Number of constraints | 160 |
| Number of domains | 1 |
| Minimum domain size | 25 |
| Maximum domain size | 25 |
| Distribution of domain sizes | [{"size":25,"count":25}] |
| Minimum variable degree | 13 |
| Maximum variable degree | 17 |
| Distribution of variable degrees | [{"degree":13,"count":16},{"degree":15,"count":8},{"degree":17,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":160}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 160 |
| Distribution of constraint types | [{"type":"intension","count":160}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Mistral-2.0 2018-08-01 (complete) | 4312501 | OPT | 4 | 0.030789 | 0.0317289 |
| cosoco 1.12 (complete) | 4301395 | OPT | 4 | 0.031522 | 0.031423 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301393 | OPT | 4 | 1.25432 | 0.602955 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312130 | OPT | 4 | 1.99269 | 1.52955 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310270 | OPT | 4 | 2.00847 | 1.18279 |
| Sat4j-CSP 2018-07-11 (complete) | 4301394 | OPT | 4 | 3.08022 | 1.58842 |
| Concrete 3.9.2-SuperNG (complete) | 4302644 | OPT | 4 | 7.14146 | 3.62192 |
| Concrete 3.9.2 (complete) | 4302294 | OPT | 4 | 7.63924 | 3.67703 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309920 | SAT | 4 | 251.844 | 247.369 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 4<instantiation type="optimum" cost="4"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] </list> <values> 3 0 4 1 2 4 1 2 3 0 2 3 0 4 1 0 4 1 2 3 1 2 3 0 4 </values> </instantiation>