| Name | Haystacks/ Haystacks-ext-10_c18.xml |
| MD5SUM | a3b0ef5b97c309412ed30b7773154191 |
| 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 | 17.7585 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 459 |
| Number of domains | 1 |
| Minimum domain size | 10 |
| Maximum domain size | 10 |
| Distribution of domain sizes | [{"size":10,"count":100}] |
| Minimum variable degree | 9 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":9,"count":82},{"degree":10,"count":18}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":459}] |
| Number of extensional constraints | 459 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":459}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2018.07.27_3 (complete) | 4301179 | UNSAT | 17.7585 | 17.7592 |
| miniBTD_12 2018.07.27_12 (complete) | 4301003 | UNSAT | 19.2083 | 19.2116 |
| NACRE 1.0.4 (complete) | 4299608 | UNSAT | 543.859 | 543.949 |
| minimacht 2018.07.27 (complete) | 4300827 | ? (TO) | 2519.97 | 2520.01 |
| cosoco 1.12 (complete) | 4299605 | ? (TO) | 2520 | 2520.01 |
| MiniCPFever 2018-04-29 (complete) | 4299607 | ? (TO) | 2520.02 | 2476.71 |
| slowpoke 2018-04-29 (incomplete) | 4299609 | ? (TO) | 2520.05 | 2496.51 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299611 | ? (TO) | 2520.05 | 2481.51 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299610 | ? (TO) | 2520.06 | 2482.81 |
| The dodo solver 2018-04-29 (complete) | 4299612 | ? (TO) | 2520.06 | 2492.71 |
| GG's minicp 2018-04-29 (complete) | 4299606 | ? (TO) | 2520.12 | 2482.42 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: