| Name | ColouredQueens/ColouredQueens-m1-s1/ ColouredQueens-19.xml |
| MD5SUM | 83a04d869151a5b67f4c27500757dc69 |
| 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 | 361 |
| Number of constraints | 108 |
| Number of domains | 1 |
| Minimum domain size | 19 |
| Maximum domain size | 19 |
| Distribution of domain sizes | [{"size":19,"count":361}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":4},{"degree":4,"count":357}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 19 |
| 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":4},{"arity":12,"count":4},{"arity":13,"count":4},{"arity":14,"count":4},{"arity":15,"count":4},{"arity":16,"count":4},{"arity":17,"count":4},{"arity":18,"count":4},{"arity":19,"count":40}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":108}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-06-30 (complete) | 4251497 | ? | 2400.01 | 2400.06 |
| miniBTD 2017-08-10 (complete) | 4264810 | ? | 2400.01 | 2400.1299 |
| Naxos 1.1.0 (complete) | 4251499 | ? (TO) | 2400.02 | 2399.8 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260070 | ? (TO) | 2400.03 | 2400 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251498 | ? (TO) | 2400.08 | 2400 |
| cosoco-mini 1.12 (complete) | 4267251 | ? (TO) | 2400.0801 | 2400.1101 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: