| Name | AllInterval/AllInterval-m1-s1/ AllInterval-040.xml |
| MD5SUM | b74d7d5d03f7c84e1bb19748e6149180 |
| 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.04831 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 79 |
| Number of constraints | 41 |
| Number of domains | 2 |
| Minimum domain size | 39 |
| Maximum domain size | 40 |
| Distribution of domain sizes | [{"size":39,"count":39},{"size":40,"count":40}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":41},{"degree":3,"count":38}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 40 |
| Distribution of constraint arities | [{"arity":3,"count":39},{"arity":39,"count":1},{"arity":40,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 39 |
| Distribution of constraint types | [{"type":"intension","count":39},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391881 | SAT | 0.04831 | 0.048824 |
| NACRE 1.0.5-Hybrid (complete) | 4391481 | SAT | 0.069596 | 0.0700311 |
| NACRE 1.0.5 (complete) | 4391681 | SAT | 0.07264 | 0.0732231 |
| cosoco 2.0 (complete) | 4408621 | SAT | 0.346835 | 0.348269 |
| cosoco 2 (complete) | 4390081 | SAT | 0.348132 | 0.353093 |
| cosoco 2.0 (complete) | 4397361 | SAT | 0.34861 | 0.350182 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407588 | SAT | 291.992 | 291.987 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type="solution"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8] y[9] y[10] y[11] y[12] y[13] y[14] y[15] y[16] y[17] y[18] y[19] y[20] y[21] y[22] y[23] y[24] y[25] y[26] y[27] y[28] y[29] y[30] y[31] y[32] y[33] y[34] y[35] y[36] y[37] y[38] </list> <values> 0 39 1 38 2 37 3 36 4 35 5 34 6 33 7 32 8 31 9 30 10 29 11 28 12 27 13 26 14 25 15 24 16 23 17 22 18 21 19 20 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 </values> </instantiation>