| Name | Primes/ Primes-m1-p20/Primes-20-20-3-3.xml |
| MD5SUM | 065412ea00e4edb14381318bc4e9318f |
| 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.006598 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 20 |
| Number of domains | 1 |
| Minimum domain size | 70 |
| Maximum domain size | 70 |
| Distribution of domain sizes | [{"size":70,"count":60}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":0,"count":40},{"degree":1,"count":35},{"degree":2,"count":17},{"degree":3,"count":8}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":3,"count":3},{"arity":4,"count":7},{"arity":5,"count":4},{"arity":6,"count":6}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":20}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.5 (complete) | 4391584 | SAT | 0.006598 | 0.00653898 |
| cosoco 2.0 (complete) | 4408524 | SAT | 0.00729 | 0.00754805 |
| cosoco 2.0 (complete) | 4397264 | SAT | 0.00756 | 0.00932111 |
| miniBTD 19.06.16 (complete) | 4391784 | SAT | 0.007672 | 0.00785202 |
| cosoco 2 (complete) | 4389984 | SAT | 0.007798 | 0.00926198 |
| NACRE 1.0.5-Hybrid (complete) | 4391384 | SAT | 0.012537 | 0.0130571 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407689 | SAT | 5.43558 | 5.43667 |
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> 2 2 39 7 2 67 2 43 2 2 2 2 4 49 7 60 2 68 2 8 8 2 2 2 2 23 2 62 3 9 2 27 2 53 2 2 6 70 2 7 71 2 2 2 69 2 71 2 4 11 2 71 2 2 2 2 70 2 2 14 51 70 2 2 30 47 2 2 27 48 10 71 4 2 71 9 7 8 2 23 2 2 5 71 8 2 2 2 6 2 69 2 27 2 2 58 2 2 2 68 </values> </instantiation>