| Name | Langford/Langford-m2-s1/ LangfordBin-20.xml |
| MD5SUM | c97ba700228b3fd10685369d1da0ace8 |
| 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.008017 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 80 |
| Number of constraints | 60 |
| Number of domains | 2 |
| Minimum domain size | 20 |
| Maximum domain size | 40 |
| Distribution of domain sizes | [{"size":20,"count":40},{"size":40,"count":40}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 40 |
| Distribution of variable degrees | [{"degree":2,"count":40},{"degree":40,"count":40}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 41 |
| Distribution of constraint arities | [{"arity":2,"count":20},{"arity":41,"count":40}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 20 |
| Distribution of constraint types | [{"type":"intension","count":20},{"type":"element","count":40}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.5 (complete) | 4391641 | SAT | 0.008017 | 0.00839896 |
| NACRE 1.0.5-Hybrid (complete) | 4391441 | SAT | 0.008537 | 0.00907001 |
| cosoco 2.0 (complete) | 4397321 | SAT | 0.028572 | 0.0300429 |
| cosoco 2.0 (complete) | 4408581 | SAT | 0.028823 | 0.0306059 |
| cosoco 2 (complete) | 4390041 | SAT | 0.02958 | 0.0309411 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407592 | SAT | 4.72465 | 4.72647 |
| miniBTD 19.06.16 (complete) | 4391841 | ? | 2400.01 | 2399.76 |
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] v[32] v[33] v[34] v[35] v[36] v[37] v[38] v[39] 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] p[32] p[33] p[34] p[35] p[36] p[37] p[38] p[39] </list> <values> 20 17 19 16 13 11 9 15 5 14 2 18 12 2 5 10 9 11 13 17 16 20 19 15 14 12 10 8 4 7 18 6 1 4 1 3 8 7 6 3 34 32 13 10 39 35 33 28 14 8 38 31 37 29 36 27 16 6 26 15 17 5 25 12 18 4 24 9 23 7 20 3 19 1 30 11 22 2 21 0 </values> </instantiation>