| Name | SumColoring/ SumColoring-myciel4_c18.xml |
| MD5SUM | b2986e349e6e3d69d494bfde8c7eda2a |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 22 |
| Best CPU time to get the best result obtained on this benchmark | 0.242313 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 23 |
| Number of constraints | 71 |
| Number of domains | 1 |
| Minimum domain size | 23 |
| Maximum domain size | 23 |
| Distribution of domain sizes | [{"size":23,"count":23}] |
| Minimum variable degree | 5 |
| Maximum variable degree | 12 |
| Distribution of variable degrees | [{"degree":5,"count":5},{"degree":6,"count":5},{"degree":7,"count":6},{"degree":9,"count":5},{"degree":11,"count":1},{"degree":12,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":71}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 71 |
| Distribution of constraint types | [{"type":"intension","count":71}] |
| 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) | 4312560 | OPT | 22 | 0.106161 | 0.108571 |
| cosoco 1.12 (complete) | 4301584 | OPT | 22 | 0.242313 | 0.243948 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301582 | OPT | 22 | 6.57372 | 4.67971 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312328 | OPT | 22 | 10.0064 | 7.88148 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310468 | OPT | 22 | 10.2991 | 8.63114 |
| Concrete 3.9.2 (complete) | 4302492 | OPT | 22 | 14.2697 | 7.16457 |
| Concrete 3.9.2-SuperNG (complete) | 4302842 | OPT | 22 | 17.0656 | 10.0092 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310118 | SAT (TO) | 22 | 252.045 | 246.627 |
| Sat4j-CSP 2018-07-11 (complete) | 4301583 | SAT (TO) | 23 | 252.142 | 249.236 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 22<instantiation type="optimum" cost="22"> <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] </list> <values> 3 4 2 2 3 1 1 1 1 1 2 0 0 0 0 0 0 0 0 0 0 0 1 </values> </instantiation>