| Name | SocialGolfers/ SocialGolfers-6-6-9-cp_c18.xml |
| MD5SUM | 438a4422dc9540b34dd70f26f18dc3ca |
| 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 | 52.4708 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 324 |
| Number of constraints | 22691 |
| Number of domains | 1 |
| Minimum domain size | 6 |
| Maximum domain size | 6 |
| Distribution of domain sizes | [{"size":6,"count":324}] |
| Minimum variable degree | 282 |
| Maximum variable degree | 283 |
| Distribution of variable degrees | [{"degree":282,"count":288},{"degree":283,"count":36}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 324 |
| Distribution of constraint arities | [{"arity":4,"count":22680},{"arity":36,"count":10},{"arity":324,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 22680 |
| Distribution of constraint types | [{"type":"intension","count":22680},{"type":"lex","count":1},{"type":"cardinality","count":9},{"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) | 4297011 | UNSAT | 52.4708 | 12.8288 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307195 | UNSAT | 184.449 | 29.8144 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307431 | UNSAT | 1188.47 | 155.783 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297247 | UNSAT | 6041.82 | 763.415 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297746 | ? (TO) | 19767.9 | 2520.16 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309102 | ? (TO) | 20007.7 | 2520.39 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291333 | ? (TO) | 20010.6 | 2520.41 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: