| Name | ColouredQueens/ ColouredQueens-11_c18.xml |
| MD5SUM | 3da25fcd556a00d93fc440927ef81e89 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 121 |
| Number of constraints | 60 |
| Number of domains | 1 |
| Minimum domain size | 11 |
| Maximum domain size | 11 |
| Distribution of domain sizes | [{"size":11,"count":121}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":4},{"degree":4,"count":117}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 11 |
| Distribution of constraint arities | [{"arity":2,"count":4},{"arity":3,"count":4},{"arity":4,"count":4},{"arity":5,"count":4},{"arity":6,"count":4},{"arity":7,"count":4},{"arity":8,"count":4},{"arity":9,"count":4},{"arity":10,"count":4},{"arity":11,"count":24}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":60}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309009 | ? (TO) | 19927.4 | 2520.36 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291240 | ? (TO) | 19941.4 | 2520.29 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307338 | ? (TO) | 20080.3 | 2520.1 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297653 | ? (TO) | 20082.2 | 2520.13 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307102 | ? (TO) | 20082.7 | 2520.08 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296918 | ? (TO) | 20086.1 | 2520.08 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297154 | ? (TO) | 20087.6 | 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: