| Name | Langford/ LangfordBin-11_c18.xml |
| MD5SUM | 0eb659d8c217bf688ca291acdf1662a5 |
| 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.006639 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 44 |
| Number of constraints | 33 |
| Number of domains | 2 |
| Minimum domain size | 11 |
| Maximum domain size | 22 |
| Distribution of domain sizes | [{"size":11,"count":22},{"size":22,"count":22}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 22 |
| Distribution of variable degrees | [{"degree":2,"count":22},{"degree":22,"count":22}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 23 |
| Distribution of constraint arities | [{"arity":2,"count":11},{"arity":23,"count":22}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 11 |
| Distribution of constraint types | [{"type":"intension","count":11},{"type":"element","count":22}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.4 (complete) | 4299269 | SAT | 0.006639 | 0.00718401 |
| cosoco 1.12 (complete) | 4299266 | SAT | 0.015022 | 0.015043 |
| GG's minicp 2018-04-29 (complete) | 4299267 | SAT | 0.642429 | 0.360427 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299272 | SAT | 0.780548 | 0.394201 |
| slowpoke 2018-04-29 (incomplete) | 4299270 | SAT | 0.995257 | 0.460559 |
| MiniCPFever 2018-04-29 (complete) | 4299268 | SAT | 1.44731 | 0.710599 |
| The dodo solver 2018-04-29 (complete) | 4299273 | SAT (TO) | 2520.08 | 2514.71 |
| miniBTD 2018.07.27_3 (complete) | 4301049 | ? | 2520 | 2519.83 |
| miniBTD_12 2018.07.27_12 (complete) | 4300873 | ? (TO) | 2519.86 | 2520.01 |
| minimacht 2018.07.27 (complete) | 4300697 | ? (TO) | 2519.95 | 2520.01 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299271 | Wrong UNSAT | 0.571952 | 0.33012 |
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] 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] </list> <values> 11 8 10 4 2 5 9 2 4 7 8 5 11 10 6 3 9 7 1 3 1 6 20 18 7 4 19 15 8 3 11 5 21 14 17 9 10 1 16 6 13 2 12 0 </values> </instantiation>