| 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.007616 |
| 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 |
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>* * 39 7 9 55 * 57 * 2 * * 2 71 2 59 * 69 * 22 2 * * * * 23 2 19 3 9 8 27 * 53 * * 6 66 * 7 68 * * * 69 * 36 * 4 64 2 71 * 2 * 35 69 * * 14 45 70 * * 30 46 * 2 27 48 10 52 4 * 71 9 58 24 * 23 2 * 6 71 8 * * * 54 * 46 * 16 2 * 35 * * * 68 </values> </instantiation>