| Name | Primes/ Primes-m1-p25/Primes-25-60-3-3.xml |
| MD5SUM | 3fdcf923ebfb65eacc6da577e9a49f9f |
| 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.04607 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 60 |
| Number of domains | 1 |
| Minimum domain size | 96 |
| Maximum domain size | 96 |
| Distribution of domain sizes | [{"size":96,"count":95}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":0,"count":5},{"degree":1,"count":23},{"degree":2,"count":17},{"degree":3,"count":23},{"degree":4,"count":15},{"degree":5,"count":8},{"degree":6,"count":6},{"degree":7,"count":2},{"degree":8,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":3,"count":8},{"arity":4,"count":19},{"arity":5,"count":14},{"arity":6,"count":19}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":60}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.5 (complete) | 4391606 | SAT | 0.04607 | 0.046213 |
| NACRE 1.0.5-Hybrid (complete) | 4391406 | SAT | 0.088383 | 0.0888501 |
| miniBTD 19.06.16 (complete) | 4391806 | SAT | 0.345342 | 0.345602 |
| cosoco 2.0 (complete) | 4397286 | SAT | 9.28467 | 9.28579 |
| cosoco 2.0 (complete) | 4408546 | SAT | 9.32054 | 9.32321 |
| cosoco 2 (complete) | 4390006 | SAT | 9.4356 | 9.43712 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407685 | SAT | 28.8747 | 28.8767 |
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> 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> 23 37 5 53 67 31 37 61 97 79 41 5 53 29 43 3 53 3 83 37 37 2 61 11 2 13 41 89 61 31 11 5 83 23 71 61 67 17 37 61 11 89 79 71 29 41 89 2 53 73 43 3 59 13 17 89 41 73 79 17 13 2 2 5 37 13 79 11 43 19 97 73 19 73 47 61 29 47 2 2 41 23 3 7 43 29 7 3 11 97 19 31 3 67 47 41 3 37 71 47 </values> </instantiation>