| Name | Langford/ LangfordBin-16_c18.xml |
| MD5SUM | 27c67f30ca0ef1b1bbbeaa4cb2c2f178 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.017017 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 48 |
| Number of domains | 2 |
| Minimum domain size | 16 |
| Maximum domain size | 32 |
| Distribution of domain sizes | [{"size":16,"count":32},{"size":32,"count":32}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 32 |
| Distribution of variable degrees | [{"degree":2,"count":32},{"degree":32,"count":32}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 33 |
| Distribution of constraint arities | [{"arity":2,"count":16},{"arity":33,"count":32}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 16 |
| Distribution of constraint types | [{"type":"intension","count":16},{"type":"element","count":32}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.4 (complete) | 4299317 | SAT | 0.017017 | 0.0176691 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299320 | SAT | 0.819367 | 0.407441 |
| GG's minicp 2018-04-29 (complete) | 4299315 | SAT | 0.875674 | 0.435142 |
| slowpoke 2018-04-29 (incomplete) | 4299318 | SAT | 1.18738 | 0.535338 |
| MiniCPFever 2018-04-29 (complete) | 4299316 | SAT | 1.71348 | 0.746261 |
| The dodo solver 2018-04-29 (complete) | 4299321 | SAT (TO) | 2520.03 | 2516.12 |
| miniBTD 2018.07.27_3 (complete) | 4301054 | ? | 2520.01 | 2519.98 |
| cosoco 1.12 (complete) | 4299314 | ? (TO) | 2519.75 | 2520.01 |
| minimacht 2018.07.27 (complete) | 4300702 | ? (TO) | 2519.8 | 2520.01 |
| miniBTD_12 2018.07.27_12 (complete) | 4300878 | ? (TO) | 2519.91 | 2520.01 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299319 | Wrong UNSAT | 0.62902 | 0.351788 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <list> v[0] v[1] v[2] v[3] v[4] v[5] v[6] v[7] v[8] v[9] v[10] v[11] v[12] v[13] v[14] v[15] v[16] v[17] v[18] v[19] v[20] v[21] v[22] v[23] v[24] v[25] v[26] v[27] v[28] v[29] v[30] v[31] p[0] p[1] p[2] p[3] p[4] p[5] p[6] p[7] p[8] p[9] p[10] p[11] p[12] p[13] p[14] p[15] p[16] p[17] p[18] p[19] p[20] p[21] p[22] p[23] p[24] p[25] p[26] p[27] p[28] p[29] p[30] p[31] </list> <values> 16 13 15 12 9 7 5 11 2 10 14 2 5 7 9 13 12 16 15 11 10 8 6 4 1 14 1 3 4 6 8 3 26 24 11 8 31 27 28 23 12 6 29 22 13 5 30 21 14 4 20 9 19 7 16 3 15 1 25 10 18 2 17 0 </values> </instantiation>