| Name | Primes/ Primes-m1-p10/Primes-10-40-3-5.xml |
| MD5SUM | b9738aa7a21d23764c9c35483473acef |
| 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 | 261.548 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 40 |
| Number of domains | 1 |
| Minimum domain size | 28 |
| Maximum domain size | 28 |
| Distribution of domain sizes | [{"size":28,"count":91}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":0,"count":9},{"degree":1,"count":19},{"degree":2,"count":29},{"degree":3,"count":25},{"degree":4,"count":15},{"degree":6,"count":3}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 8 |
| Distribution of constraint arities | [{"arity":3,"count":3},{"arity":4,"count":8},{"arity":5,"count":9},{"arity":6,"count":5},{"arity":7,"count":6},{"arity":8,"count":9}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":40}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391886 | SAT | 261.548 | 261.527 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407692 | SAT | 2266.26 | 2266.09 |
| cosoco 2 (complete) | 4390086 | ? (TO) | 2400.02 | 2400.2 |
| cosoco 2.0 (complete) | 4408626 | ? (TO) | 2400.05 | 2400.11 |
| NACRE 1.0.5-Hybrid (complete) | 4391486 | ? (TO) | 2400.06 | 2400.31 |
| NACRE 1.0.5 (complete) | 4391686 | ? (TO) | 2400.07 | 2400.01 |
| cosoco 2.0 (complete) | 4397366 | ? (TO) | 2400.09 | 2399.9 |
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> 24 2 29 2 21 4 21 2 27 16 9 2 4 6 4 21 3 14 22 17 2 8 12 23 2 22 12 19 29 9 2 6 29 24 24 25 2 24 3 17 2 14 2 12 22 28 27 25 5 2 9 2 2 3 2 27 3 6 18 5 19 19 12 16 4 12 4 29 20 29 5 12 16 12 28 20 23 2 7 12 27 14 29 19 21 5 3 2 18 28 7 2 2 17 25 2 11 2 20 4 </values> </instantiation>