| Name | SocialGolfers/ SocialGolfers-6-6-8-cp_c18.xml |
| MD5SUM | 8a9161d398725f1a5fa3c8de0eb5bbd3 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 867.941 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 288 |
| Number of constraints | 17650 |
| Number of domains | 1 |
| Minimum domain size | 6 |
| Maximum domain size | 6 |
| Distribution of domain sizes | [{"size":6,"count":288}] |
| Minimum variable degree | 247 |
| Maximum variable degree | 248 |
| Distribution of variable degrees | [{"degree":247,"count":252},{"degree":248,"count":36}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 288 |
| Distribution of constraint arities | [{"arity":4,"count":17640},{"arity":36,"count":9},{"arity":288,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 17640 |
| Distribution of constraint types | [{"type":"intension","count":17640},{"type":"lex","count":1},{"type":"cardinality","count":8},{"type":"instantiation","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| scop both+glucose-syrup (2018-07-31) (complete) | 4307430 | UNSAT | 867.941 | 114.725 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297010 | UNSAT | 3098.15 | 393.616 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297745 | ? (TO) | 19851.8 | 2520.17 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309101 | ? (TO) | 20012 | 2520.4 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291332 | ? (TO) | 20017.3 | 2520.38 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307194 | ? (TO) | 20052 | 2520.07 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297246 | ? (TO) | 20058.4 | 2520.09 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: