| Name | Primes/ Primes-m1-p30/Primes-30-80-3-7.xml |
| MD5SUM | d6f47189ec9a9650b4b34af3081cbaad |
| 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.237203 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 80 |
| Number of domains | 1 |
| Minimum domain size | 112 |
| Maximum domain size | 112 |
| Distribution of domain sizes | [{"size":112,"count":100}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 12 |
| Distribution of variable degrees | [{"degree":1,"count":3},{"degree":2,"count":3},{"degree":3,"count":7},{"degree":4,"count":26},{"degree":5,"count":14},{"degree":6,"count":23},{"degree":7,"count":15},{"degree":8,"count":2},{"degree":9,"count":2},{"degree":10,"count":3},{"degree":11,"count":1},{"degree":12,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":3,"count":10},{"arity":4,"count":9},{"arity":5,"count":13},{"arity":6,"count":3},{"arity":7,"count":12},{"arity":8,"count":9},{"arity":9,"count":11},{"arity":10,"count":13}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":80}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.5-Hybrid (complete) | 4391495 | SAT | 0.237203 | 0.237579 |
| NACRE 1.0.5 (complete) | 4391695 | SAT | 0.2976 | 0.297751 |
| miniBTD 19.06.16 (complete) | 4391895 | SAT | 0.353284 | 0.353547 |
| cosoco 2.0 (complete) | 4408635 | SAT | 1.23907 | 1.34953 |
| cosoco 2.0 (complete) | 4397375 | SAT | 1.23953 | 1.23901 |
| cosoco 2 (complete) | 4390095 | SAT | 1.24955 | 1.25004 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407690 | SAT | 114.646 | 114.65 |
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> 43 59 107 101 89 101 59 41 29 3 5 19 73 71 89 59 2 17 83 59 37 23 107 29 5 73 5 43 19 101 113 41 41 67 113 107 43 59 3 83 29 7 79 113 47 19 23 47 13 2 89 59 3 73 103 7 5 73 59 3 53 53 47 107 103 13 59 29 43 61 97 53 41 53 47 107 47 47 7 73 19 67 17 23 23 97 7 37 47 71 41 2 103 67 71 83 59 17 97 113 </values> </instantiation>