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 | 830 |
Best CPU time to get the best result obtained on this benchmark | 20046.2 |
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 |
---|---|---|---|---|---|
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291091 | SAT (TO) | 826 | 19957.8 | 2520.24 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4308860 | SAT (TO) | 826 | 19961.5 | 2520.32 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297504 | SAT (TO) | 830 | 20046.2 | 2520.14 |
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 5 6 7 0 3 8 6 3 6 6 6 4 4 4 4 2 2 7 7 7 7 5 4 5 1 4 4 4 9 6 7 6 5 4 3 5 7 7 9 9 2 3 3 2 7 5 7 3 6 6 2 4 3 4 8 5 5 8 5 5 5 5 6 6 3 8 6 3 1 6 5 9 </values> </instantiation>