| Name | Primes/ Primes-m1-p15/Primes-15-20-2-7.xml |
| MD5SUM | d26c1a16a8e9a423ebbeb7c1b2e2b431 |
| 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.008024 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 20 |
| Number of domains | 1 |
| Minimum domain size | 46 |
| Maximum domain size | 46 |
| Distribution of domain sizes | [{"size":46,"count":76}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":0,"count":24},{"degree":1,"count":44},{"degree":2,"count":15},{"degree":3,"count":11},{"degree":4,"count":5},{"degree":5,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":3,"count":2},{"arity":4,"count":3},{"arity":6,"count":4},{"arity":7,"count":2},{"arity":8,"count":5},{"arity":9,"count":4}] |
| 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>30 * 3 13 23 33 15 2 44 4 2 47 46 2 7 * * 2 * 3 47 13 * 46 40 44 2 12 46 47 41 * 2 45 2 2 46 2 24 2 2 4 * 35 47 * 34 32 2 * 28 * * 21 46 2 45 * * 47 2 19 * 47 3 39 2 47 * 2 * * 47 47 32 46 * * * 2 * 5 2 47 45 23 47 19 28 2 21 5 9 2 12 * * 2 * 46 </values> </instantiation>