| Name | SocialGolfers/ SocialGolfers-5-5-7-cp_c18.xml |
| MD5SUM | 3c85bec313e0e9ed0b53ce41ef97f039 |
| 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 | 22.6234 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 175 |
| Number of constraints | 6309 |
| Number of domains | 1 |
| Minimum domain size | 5 |
| Maximum domain size | 5 |
| Distribution of domain sizes | [{"size":5,"count":175}] |
| Minimum variable degree | 146 |
| Maximum variable degree | 147 |
| Distribution of variable degrees | [{"degree":146,"count":150},{"degree":147,"count":25}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 175 |
| Distribution of constraint arities | [{"arity":4,"count":6300},{"arity":25,"count":8},{"arity":175,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 6300 |
| Distribution of constraint types | [{"type":"intension","count":6300},{"type":"lex","count":1},{"type":"cardinality","count":7},{"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) | 4297006 | UNSAT | 22.6234 | 6.14603 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297242 | UNSAT | 23.9383 | 6.09918 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307426 | UNSAT | 25.1654 | 6.97003 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307190 | UNSAT | 26.7557 | 7.16669 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291328 | ? (TO) | 20011.9 | 2520.39 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309097 | ? (TO) | 20019.8 | 2520.47 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297741 | ? (TO) | 20050 | 2520.12 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: