| Name | SocialGolfers/ SocialGolfers-5-5-5-cp_c18.xml |
| MD5SUM | 01658bc7723d571de51995bec243d654 |
| 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 | 12.2397 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 125 |
| Number of constraints | 3007 |
| Number of domains | 1 |
| Minimum domain size | 5 |
| Maximum domain size | 5 |
| Distribution of domain sizes | [{"size":5,"count":125}] |
| Minimum variable degree | 98 |
| Maximum variable degree | 99 |
| Distribution of variable degrees | [{"degree":98,"count":100},{"degree":99,"count":25}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 125 |
| Distribution of constraint arities | [{"arity":4,"count":3000},{"arity":25,"count":6},{"arity":125,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 3000 |
| Distribution of constraint types | [{"type":"intension","count":3000},{"type":"lex","count":1},{"type":"cardinality","count":5},{"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) | 4309095 | SAT | 12.2397 | 3.42558 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297240 | SAT | 14.7991 | 4.21556 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297004 | SAT | 15.1121 | 4.23168 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307424 | SAT | 15.5894 | 5.12261 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307188 | SAT | 15.6181 | 5.14738 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297739 | SAT | 21.1891 | 6.1871 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291326 | SAT (TO) | 10095.8 | 2520.05 |
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] </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 2 4 0 1 3 3 0 1 2 4 1 3 4 0 2 0 2 3 4 1 4 1 2 3 0 4 3 1 0 2 1 4 2 3 0 3 0 4 2 1 0 2 3 1 4 2 1 0 4 3 4 3 2 1 0 1 0 3 2 4 0 2 1 4 3 3 1 4 0 2 2 4 0 3 1 </values> </instantiation>