| Name | QuadraticAssignment/ QuadraticAssignment-had12_c18.xml |
| MD5SUM | fafdea6ca4d8abc1bd6cd2f98399b858 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 826 |
| Best CPU time to get the best result obtained on this benchmark | 302.804 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 156 |
| Number of constraints | 67 |
| Number of domains | 2 |
| Minimum domain size | 10 |
| Maximum domain size | 12 |
| Distribution of domain sizes | [{"size":10,"count":66},{"size":12,"count":12}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 12 |
| Distribution of variable degrees | [{"degree":0,"count":78},{"degree":2,"count":66},{"degree":12,"count":12}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 12 |
| Distribution of constraint arities | [{"arity":3,"count":66},{"arity":12,"count":1}] |
| Number of extensional constraints | 66 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":66},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298841 | SAT | 826 | 302.804 | 300.345 |
| MiniCPFever 2018-04-29 (complete) | 4298838 | SAT (TO) | 828 | 2520.06 | 2494.13 |
| cosoco 1.12 (complete) | 4298836 | SAT (TO) | 832 | 2520.08 | 2520.01 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298840 | SAT (TO) | 840 | 2520.1 | 2490.52 |
| slowpoke 2018-04-29 (incomplete) | 4298839 | SAT (TO) | 884 | 2520.09 | 2513.02 |
| GG's minicp 2018-04-29 (complete) | 4298837 | SAT (TO) | 896 | 2520.04 | 2514.02 |
| The dodo solver 2018-04-29 (complete) | 4298842 | SAT (TO) | 900 | 2520.06 | 2516.92 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 826<instantiation> <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] d[0][1] d[0][2] d[0][3] d[0][4] d[0][5] d[0][6] d[0][7] d[0][8] d[0][9] d[0][10] d[0][11] d[1][2] d[1][3] d[1][4] d[1][5] d[1][6] d[1][7] d[1][8] d[1][9] d[1][10] d[1][11] d[2][3] d[2][4] d[2][5] d[2][6] d[2][7] d[2][8] d[2][9] d[2][10] d[2][11] d[3][4] d[3][5] d[3][6] d[3][7] d[3][8] d[3][9] d[3][10] d[3][11] d[4][5] d[4][6] d[4][7] d[4][8] d[4][9] d[4][10] d[4][11] d[5][6] d[5][7] d[5][8] d[5][9] d[5][10] d[5][11] d[6][7] d[6][8] d[6][9] d[6][10] d[6][11] d[7][8] d[7][9] d[7][10] d[7][11] d[8][9] d[8][10] d[8][11] d[9][10] d[9][11] d[10][11] </list> <values> 2 9 10 1 11 4 6 5 7 0 3 8 6 3 6 6 6 4 4 4 4 2 2 7 7 7 7 4 5 5 1 4 4 4 9 6 6 7 5 4 3 5 7 7 9 9 2 3 3 2 7 7 5 3 6 6 2 3 4 4 8 5 5 8 6 6 3 8 5 5 5 5 6 3 1 6 5 9 </values> </instantiation>