| Name | Langford/ LangfordBin-07_c18.xml |
| MD5SUM | 3bc0c2fe6daffe5cd6c78f401afaf84f |
| 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.004664 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 28 |
| Number of constraints | 21 |
| Number of domains | 2 |
| Minimum domain size | 7 |
| Maximum domain size | 14 |
| Distribution of domain sizes | [{"size":7,"count":14},{"size":14,"count":14}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":2,"count":14},{"degree":14,"count":14}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 15 |
| Distribution of constraint arities | [{"arity":2,"count":7},{"arity":15,"count":14}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 7 |
| Distribution of constraint types | [{"type":"intension","count":7},{"type":"element","count":14}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.4 (complete) | 4299301 | SAT | 0.004664 | 0.005595 |
| cosoco 1.12 (complete) | 4299298 | SAT | 0.007287 | 0.00799507 |
| minimacht 2018.07.27 (complete) | 4300693 | SAT | 0.133173 | 0.133172 |
| miniBTD_12 2018.07.27_12 (complete) | 4300869 | SAT | 0.159453 | 0.160174 |
| miniBTD 2018.07.27_3 (complete) | 4301045 | SAT | 0.160988 | 0.161356 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299304 | SAT | 0.587423 | 0.335673 |
| GG's minicp 2018-04-29 (complete) | 4299299 | SAT | 0.594739 | 0.332972 |
| MiniCPFever 2018-04-29 (complete) | 4299300 | SAT | 0.603541 | 0.339817 |
| slowpoke 2018-04-29 (incomplete) | 4299302 | SAT | 0.624802 | 0.358205 |
| The dodo solver 2018-04-29 (complete) | 4299305 | SAT (TO) | 2520.12 | 2513.42 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299303 | Wrong UNSAT | 0.545757 | 0.326239 |
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] 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] </list> <values> 7 2 6 3 2 4 5 3 7 6 4 1 5 1 13 11 4 1 7 3 10 5 12 6 9 2 8 0 </values> </instantiation>