| Name | SteelMillSlab_Mini/ SteelMillSlab-m2s-mini-simple_c18.xml |
| MD5SUM | 4c99765df098abb1ee0e5ddce9c6b7bf |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 0 |
| Best CPU time to get the best result obtained on this benchmark | 0.015892 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 160 |
| Number of constraints | 230 |
| Number of domains | 4 |
| Minimum domain size | 2 |
| Maximum domain size | 19 |
| Distribution of domain sizes | [{"size":2,"count":130},{"size":5,"count":10},{"size":10,"count":10},{"size":19,"count":10}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 20 |
| Distribution of variable degrees | [{"degree":2,"count":120},{"degree":3,"count":10},{"degree":4,"count":10},{"degree":6,"count":10},{"degree":20,"count":10}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 11 |
| Distribution of constraint arities | [{"arity":2,"count":210},{"arity":3,"count":10},{"arity":11,"count":10}] |
| Number of extensional constraints | 210 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":210},{"type":"sum","count":20}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4300221 | OPT | 0 | 0.015892 | 0.0169279 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300225 | OPT | 0 | 0.851344 | 0.438632 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300226 | SAT | 0 | 304.916 | 300.395 |
| slowpoke 2018-04-29 (incomplete) | 4300224 | SAT (TO) | 0 | 2520.08 | 2508.03 |
| MiniCPFever 2018-04-29 (complete) | 4300223 | SAT (TO) | 0 | 2520.09 | 2483.32 |
| GG's minicp 2018-04-29 (complete) | 4300222 | SAT (TO) | 0 | 2520.09 | 2501.72 |
| The dodo solver 2018-04-29 (complete) | 4300227 | SAT (TO) | 0 | 2520.09 | 2508.13 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 0<instantiation type='solution' cost='0'> <list>load[0] load[1] load[2] load[3] load[4] load[5] load[6] load[7] load[8] load[9] loss[0] loss[1] loss[2] loss[3] loss[4] loss[5] loss[6] loss[7] loss[8] loss[9] slab[0] slab[1] slab[2] slab[3] slab[4] slab[5] slab[6] slab[7] slab[8] slab[9] y[0][0] y[0][1] y[0][2] y[0][3] y[0][4] y[0][5] y[0][6] y[0][7] y[0][8] y[0][9] y[1][0] y[1][1] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6] y[1][7] y[1][8] y[1][9] y[2][0] y[2][1] y[2][2] y[2][3] y[2][4] y[2][5] y[2][6] y[2][7] y[2][8] y[2][9] y[3][0] y[3][1] y[3][2] y[3][3] y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[3][9] y[4][0] y[4][1] y[4][2] y[4][3] y[4][4] y[4][5] y[4][6] y[4][7] y[4][8] y[4][9] y[5][0] y[5][1] y[5][2] y[5][3] y[5][4] y[5][5] y[5][6] y[5][7] y[5][8] y[5][9] y[6][0] y[6][1] y[6][2] y[6][3] y[6][4] y[6][5] y[6][6] y[6][7] y[6][8] y[6][9] y[7][0] y[7][1] y[7][2] y[7][3] y[7][4] y[7][5] y[7][6] y[7][7] y[7][8] y[7][9] y[8][0] y[8][1] y[8][2] y[8][3] y[8][4] y[8][5] y[8][6] y[8][7] y[8][8] y[8][9] y[9][0] y[9][1] y[9][2] y[9][3] y[9][4] y[9][5] y[9][6] y[9][7] y[9][8] y[9][9] z[0][0] z[0][1] z[0][2] z[1][0] z[1][1] z[1][2] z[2][0] z[2][1] z[2][2] z[3][0] z[3][1] z[3][2] z[4][0] z[4][1] z[4][2] z[5][0] z[5][1] z[5][2] z[6][0] z[6][1] z[6][2] z[7][0] z[7][1] z[7][2] z[8][0] z[8][1] z[8][2] z[9][0] z[9][1] z[9][2] </list> <values>0 0 5 9 0 0 5 11 18 0 0 0 0 0 0 0 0 0 0 0 3 3 6 8 8 7 2 6 3 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 1 1 0 1 0 0 0 0 1 0 0 0 </values> </instantiation>