| Name | SocialGolfers/ SocialGolfers-5-5-6-cp_c18.xml |
| MD5SUM | 7cf8ff1aade64c35eba6df9cb38cb5a8 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 13.243 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 150 |
| Number of constraints | 4508 |
| Number of domains | 1 |
| Minimum domain size | 5 |
| Maximum domain size | 5 |
| Distribution of domain sizes | [{"size":5,"count":150}] |
| Minimum variable degree | 122 |
| Maximum variable degree | 123 |
| Distribution of variable degrees | [{"degree":122,"count":125},{"degree":123,"count":25}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 150 |
| Distribution of constraint arities | [{"arity":4,"count":4500},{"arity":25,"count":7},{"arity":150,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 4500 |
| Distribution of constraint types | [{"type":"intension","count":4500},{"type":"lex","count":1},{"type":"cardinality","count":6},{"type":"instantiation","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309096 | SAT | 13.243 | 4.24881 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291327 | SAT | 14.0068 | 3.73719 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297005 | SAT | 16.9217 | 4.98373 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307189 | SAT | 17.4628 | 5.78682 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307425 | SAT | 18.0042 | 5.89116 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297241 | SAT | 18.044 | 5.1877 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297740 | SAT | 30.118 | 9.18221 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <list> x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[0][8] x[0][9] x[0][10] x[0][11] x[0][12] x[0][13] x[0][14] x[0][15] x[0][16] x[0][17] x[0][18] x[0][19] x[0][20] x[0][21] x[0][22] x[0][23] x[0][24] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[1][9] x[1][10] x[1][11] x[1][12] x[1][13] x[1][14] x[1][15] x[1][16] x[1][17] x[1][18] x[1][19] x[1][20] x[1][21] x[1][22] x[1][23] x[1][24] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[2][9] x[2][10] x[2][11] x[2][12] x[2][13] x[2][14] x[2][15] x[2][16] x[2][17] x[2][18] x[2][19] x[2][20] x[2][21] x[2][22] x[2][23] x[2][24] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[3][9] x[3][10] x[3][11] x[3][12] x[3][13] x[3][14] x[3][15] x[3][16] x[3][17] x[3][18] x[3][19] x[3][20] x[3][21] x[3][22] x[3][23] x[3][24] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[4][9] x[4][10] x[4][11] x[4][12] x[4][13] x[4][14] x[4][15] x[4][16] x[4][17] x[4][18] x[4][19] x[4][20] x[4][21] x[4][22] x[4][23] x[4][24] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8] x[5][9] x[5][10] x[5][11] x[5][12] x[5][13] x[5][14] x[5][15] x[5][16] x[5][17] x[5][18] x[5][19] x[5][20] x[5][21] x[5][22] x[5][23] x[5][24] </list> <values> 0 0 0 0 0 1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 4 4 4 4 4 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 0 2 1 3 4 3 4 0 2 1 4 0 2 1 3 2 1 3 4 0 1 3 4 0 2 0 2 1 3 4 4 0 2 1 3 1 3 4 0 2 3 4 0 2 1 2 1 3 4 0 0 2 4 3 1 4 3 1 0 2 2 4 3 1 0 1 0 2 4 3 3 1 0 2 4 4 3 2 1 0 3 2 1 0 4 1 0 4 3 2 2 1 0 4 3 0 4 3 2 1 </values> </instantiation>