| Name | SocialGolfers/ SocialGolfers-4-4-5-cp_c18.xml |
| MD5SUM | 9520b1c3a7fc9338271b16f0cb9e04b3 |
| 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 | 8.77848 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 80 |
| Number of constraints | 1207 |
| Number of domains | 1 |
| Minimum domain size | 4 |
| Maximum domain size | 4 |
| Distribution of domain sizes | [{"size":4,"count":80}] |
| Minimum variable degree | 62 |
| Maximum variable degree | 63 |
| Distribution of variable degrees | [{"degree":62,"count":64},{"degree":63,"count":16}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 80 |
| Distribution of constraint arities | [{"arity":4,"count":1200},{"arity":16,"count":6},{"arity":80,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1200 |
| Distribution of constraint types | [{"type":"intension","count":1200},{"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 |
|---|---|---|---|---|
| scop order+glucose-syrup (2018-07-07) (complete) | 4297001 | SAT | 8.77848 | 2.83809 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297237 | SAT | 9.31857 | 2.94111 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309092 | SAT | 9.33355 | 2.92676 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307421 | SAT | 10.212 | 3.78876 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297736 | SAT | 10.399 | 2.55225 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307185 | SAT | 10.4033 | 3.82214 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291323 | SAT | 11.6394 | 3.35728 |
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[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[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[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[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]</list> <values>0 0 0 0 1 1 1 1 2 2 2 2 3 3 3 3 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 3 2 1 0 3 0 3 2 1 3 0 1 2 1 2 3 0 2 3 0 1 1 0 3 2 3 2 1 0 0 1 2 3 2 3 1 0 3 2 0 1 1 0 2 3 0 1 3 2</values> </instantiation>