| Name | QuadraticAssignment/ QuadraticAssignment-esc32d_c18.xml |
| MD5SUM | ca834160bf20391dc7be2075ee08801e |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 103 |
| Best CPU time to get the best result obtained on this benchmark | 20072.7 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 1056 |
| Number of constraints | 91 |
| Number of domains | 2 |
| Minimum domain size | 5 |
| Maximum domain size | 32 |
| Distribution of domain sizes | [{"size":5,"count":90},{"size":32,"count":32}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":0,"count":934},{"degree":1,"count":14},{"degree":2,"count":92},{"degree":4,"count":2},{"degree":10,"count":2},{"degree":13,"count":2},{"degree":14,"count":10}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 32 |
| Distribution of constraint arities | [{"arity":3,"count":90},{"arity":32,"count":1}] |
| Number of extensional constraints | 90 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":90},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297502 | SAT (TO) | 103 | 20072.7 | 2520.11 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308858 | SAT (TO) | 124 | 19978.6 | 2520.22 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291089 | SAT (TO) | 127 | 20006.3 | 2520.27 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 103<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] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] d[0][1] d[0][3] d[0][4] d[0][6] d[0][7] d[0][8] d[0][9] d[0][10] d[0][13] d[0][15] d[0][16] d[0][17] d[1][4] d[1][5] d[1][6] d[1][7] d[1][8] d[1][9] d[1][10] d[1][13] d[1][14] d[1][15] d[1][16] d[1][17] d[2][4] d[2][11] d[2][13] d[4][6] d[4][7] d[4][8] d[4][9] d[4][10] d[4][11] d[4][13] d[4][15] d[4][16] d[4][17] d[5][6] d[5][7] d[5][8] d[5][10] d[5][14] d[5][15] d[5][16] d[5][17] d[6][7] d[6][8] d[6][9] d[6][10] d[6][13] d[6][14] d[6][15] d[6][16] d[6][17] d[7][8] d[7][9] d[7][10] d[7][13] d[7][14] d[7][15] d[7][16] d[7][17] d[8][9] d[8][10] d[8][13] d[8][14] d[8][15] d[8][16] d[8][17] d[9][10] d[9][12] d[9][13] d[9][15] d[9][16] d[9][17] d[10][13] d[10][14] d[10][15] d[10][16] d[10][17] d[11][13] d[13][15] d[13][16] d[13][17] d[14][15] d[14][16] d[14][17] d[15][16] d[15][17] d[16][17] </list> <values>0 9 21 2 1 12 8 4 10 3 11 17 19 5 14 15 7 13 23 29 26 6 18 27 31 30 16 22 28 25 20 24 1 0 0 0 0 1 1 2 1 3 2 2 0 1 0 2 1 1 0 1 2 1 2 0 1 0 0 1 1 2 0 1 0 0 2 1 1 0 0 1 2 0 1 2 0 1 0 2 1 2 1 2 3 1 2 2 3 0 1 2 1 1 1 0 3 0 1 2 2 0 0 1 1 0 2 2 1 0 1 1 1 1 0 0 0 1 1 0 0 1 </values> </instantiation>