| Name | Primes/ Primes-m1-p20/Primes-20-40-2-7.xml |
| MD5SUM | 37689576328d0295b96bd2728694e285 |
| 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 | 1.82575 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 40 |
| Number of domains | 1 |
| Minimum domain size | 70 |
| Maximum domain size | 70 |
| Distribution of domain sizes | [{"size":70,"count":88}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 7 |
| Distribution of variable degrees | [{"degree":0,"count":12},{"degree":1,"count":20},{"degree":2,"count":25},{"degree":3,"count":20},{"degree":4,"count":12},{"degree":5,"count":5},{"degree":6,"count":3},{"degree":7,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":2,"count":4},{"arity":3,"count":4},{"arity":4,"count":4},{"arity":5,"count":2},{"arity":6,"count":7},{"arity":7,"count":4},{"arity":8,"count":9},{"arity":9,"count":6}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":40}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391919 | SAT | 1.82575 | 1.82981 |
| NACRE 1.0.5 (complete) | 4391719 | SAT | 15.7218 | 15.7219 |
| NACRE 1.0.5-Hybrid (complete) | 4391519 | SAT | 81.7219 | 81.7636 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407688 | SAT | 1520.8 | 1520.62 |
| cosoco 2.0 (complete) | 4408659 | ? (TO) | 2400.02 | 2400.11 |
| cosoco 2.0 (complete) | 4397399 | ? (TO) | 2400.03 | 2400.01 |
| cosoco 2 (complete) | 4390119 | ? (TO) | 2400.08 | 2399.9 |
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] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] </list> <values> 4 2 48 68 11 53 63 20 41 9 5 8 63 19 2 18 2 53 7 5 55 46 2 8 38 46 30 27 2 7 51 49 4 47 32 23 31 62 41 2 69 15 60 62 69 32 52 2 56 24 20 50 2 2 39 38 7 41 2 3 13 69 2 39 22 71 30 2 22 71 2 53 4 26 48 8 2 2 2 28 2 13 3 53 11 37 2 34 36 28 47 8 59 63 44 33 2 41 47 69 </values> </instantiation>