| Name | QuadraticAssignment/ QuadraticAssignment-had14_c18.xml |
| MD5SUM | 1b212baf1dbc84cffd3dcab4dc49ff1b |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 1362 |
| Best CPU time to get the best result obtained on this benchmark | 2520.06 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 210 |
| Number of constraints | 92 |
| Number of domains | 2 |
| Minimum domain size | 10 |
| Maximum domain size | 14 |
| Distribution of domain sizes | [{"size":10,"count":91},{"size":14,"count":14}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":0,"count":105},{"degree":2,"count":91},{"degree":14,"count":14}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 14 |
| Distribution of constraint arities | [{"arity":3,"count":91},{"arity":14,"count":1}] |
| Number of extensional constraints | 91 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":91},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| MiniCPFever 2018-04-29 (complete) | 4298929 | SAT (TO) | 1362 | 2520.06 | 2501.32 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298932 | SAT | 1372 | 302.77 | 300.422 |
| cosoco 1.12 (complete) | 4298927 | SAT (TO) | 1385 | 2520.06 | 2520.01 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298931 | SAT (TO) | 1438 | 2520.08 | 2492.42 |
| slowpoke 2018-04-29 (incomplete) | 4298930 | SAT (TO) | 1463 | 2520.1 | 2511.32 |
| The dodo solver 2018-04-29 (complete) | 4298933 | SAT (TO) | 1476 | 2520.1 | 2516.91 |
| GG's minicp 2018-04-29 (complete) | 4298928 | SAT (TO) | 1512 | 2520.06 | 2512.52 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1362<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] x[12] x[13] 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[0][12] d[0][13] 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[1][12] d[1][13] 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[2][12] d[2][13] 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[3][12] d[3][13] d[4][5] d[4][6] d[4][7] d[4][8] d[4][9] d[4][10] d[4][11] d[4][12] d[4][13] d[5][6] d[5][7] d[5][8] d[5][9] d[5][10] d[5][11] d[5][12] d[5][13] d[6][7] d[6][8] d[6][9] d[6][10] d[6][11] d[6][12] d[6][13] d[7][8] d[7][9] d[7][10] d[7][11] d[7][12] d[7][13] d[8][9] d[8][10] d[8][11] d[8][12] d[8][13] d[9][10] d[9][11] d[9][12] d[9][13] d[10][11] d[10][12] d[10][13] d[11][12] d[11][13] d[12][13] </list> <values> 7 12 4 9 11 10 1 13 2 5 6 0 8 3 7 4 5 3 5 2 5 4 5 6 6 1 3 7 5 6 6 9 5 5 1 1 1 4 3 7 7 6 7 3 6 4 3 8 5 5 7 7 7 6 6 5 4 1 4 4 9 7 5 6 5 7 6 2 6 4 5 3 7 6 4 5 3 6 6 9 9 3 2 3 6 8 8 5 5 4 4 4 4 2 2 8 5 5 5 6 8 3 5 6 9 </values> </instantiation>