Name | QuadraticAssignment/ QuadraticAssignment-esc32a_c18.xml |
MD5SUM | ca8832984a17c67db3e889c6d91adcf4 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 65 |
Best CPU time to get the best result obtained on this benchmark | 2520.05 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 1056 |
Number of constraints | 75 |
Number of domains | 2 |
Minimum domain size | 5 |
Maximum domain size | 32 |
Distribution of domain sizes | [{"size":5,"count":74},{"size":32,"count":32}] |
Minimum variable degree | 0 |
Maximum variable degree | 11 |
Distribution of variable degrees | [{"degree":0,"count":950},{"degree":1,"count":7},{"degree":2,"count":75},{"degree":4,"count":1},{"degree":5,"count":2},{"degree":6,"count":4},{"degree":7,"count":8},{"degree":8,"count":6},{"degree":9,"count":2},{"degree":11,"count":1}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 32 |
Distribution of constraint arities | [{"arity":3,"count":74},{"arity":32,"count":1}] |
Number of extensional constraints | 74 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":74},{"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) | 4298887 | SAT (TO) | 65 | 2520.05 | 2483.22 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298890 | SAT | 68 | 303.258 | 300.419 |
The dodo solver 2018-04-29 (complete) | 4298891 | SAT (TO) | 73 | 2520.08 | 2516.03 |
GG's minicp 2018-04-29 (complete) | 4298886 | SAT (TO) | 75 | 2520.1 | 2492.13 |
cosoco 1.12 (complete) | 4298885 | SAT (TO) | 93 | 2520.03 | 2520.01 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298889 | SAT (TO) | 120 | 2520.03 | 2479.04 |
slowpoke 2018-04-29 (incomplete) | 4298888 | SAT (TO) | 137 | 2520.08 | 2505.42 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 65<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][2] d[0][5] d[0][10] d[0][12] d[0][21] d[1][2] d[1][4] d[1][8] d[1][13] d[2][3] d[2][8] d[2][14] d[2][17] d[3][4] d[3][5] d[3][8] d[3][14] d[3][17] d[4][5] d[4][8] d[4][13] d[5][10] d[5][12] d[5][21] d[7][15] d[7][16] d[7][20] d[7][22] d[7][23] d[7][24] d[7][26] d[8][13] d[8][14] d[8][17] d[9][23] d[10][12] d[10][16] d[10][18] d[10][21] d[11][15] d[11][16] d[11][21] d[11][25] d[12][13] d[12][14] d[12][21] d[13][14] d[14][17] d[15][20] d[15][22] d[15][23] d[15][25] d[15][26] d[16][18] d[16][24] d[16][25] d[16][26] d[17][18] d[17][20] d[17][23] d[17][26] d[18][20] d[18][23] d[18][26] d[20][22] d[20][23] d[20][26] d[21][24] d[21][26] d[22][23] d[22][26] d[23][26] d[24][26] </list> <values> 0 1 3 7 5 4 17 22 13 27 12 16 8 9 11 18 28 15 14 6 23 24 19 31 26 20 30 21 25 29 2 10 0 1 0 1 0 1 0 0 1 0 0 2 0 1 0 1 1 1 0 0 0 1 0 1 2 0 1 0 1 1 1 0 0 1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 1 0 2 1 1 1 1 0 0 0 1 0 1 2 1 0 0 0 1 0 1 1 2 0 0 </values> </instantiation>