| Name | SocialGolfers/ SocialGolfers-4-4-4-cp_c18.xml |
| MD5SUM | 323265c27f21e70af41ff0037033f3ab |
| 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 | 6.99933 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 726 |
| Number of domains | 1 |
| Minimum domain size | 4 |
| Maximum domain size | 4 |
| Distribution of domain sizes | [{"size":4,"count":64}] |
| Minimum variable degree | 47 |
| Maximum variable degree | 48 |
| Distribution of variable degrees | [{"degree":47,"count":48},{"degree":48,"count":16}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 64 |
| Distribution of constraint arities | [{"arity":4,"count":720},{"arity":16,"count":5},{"arity":64,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 720 |
| Distribution of constraint types | [{"type":"intension","count":720},{"type":"lex","count":1},{"type":"cardinality","count":4},{"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) | 4297000 | SAT | 6.99933 | 2.52527 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297236 | SAT | 7.07286 | 2.54494 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309091 | SAT | 7.38394 | 2.69534 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291322 | SAT | 7.8304 | 2.76988 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307420 | SAT | 8.01762 | 3.34209 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307184 | SAT | 8.14691 | 3.35956 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297735 | SAT | 9.6743 | 2.22483 |
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]</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 0 1 3 3 1 0 2 1 3 2 0 0 2 3 1 2 1 3 0 3 0 2 1 1 2 0 3 0 3 1 2</values> </instantiation>