Name | Primes/ Primes-m1-p20/Primes-20-60-3-5.xml |
MD5SUM | 0dd1a305ead2bfc8d563708a38f33655 |
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 | 517.414 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 100 |
Number of constraints | 60 |
Number of domains | 1 |
Minimum domain size | 70 |
Maximum domain size | 70 |
Distribution of domain sizes | [{"size":70,"count":99}] |
Minimum variable degree | 0 |
Maximum variable degree | 8 |
Distribution of variable degrees | [{"degree":0,"count":1},{"degree":1,"count":14},{"degree":2,"count":13},{"degree":3,"count":22},{"degree":4,"count":24},{"degree":5,"count":17},{"degree":6,"count":6},{"degree":7,"count":2},{"degree":8,"count":1}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 8 |
Distribution of constraint arities | [{"arity":3,"count":5},{"arity":4,"count":10},{"arity":5,"count":15},{"arity":6,"count":8},{"arity":7,"count":9},{"arity":8,"count":13}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":60}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
miniBTD 19.06.16 (complete) | 4391910 | SAT | 517.414 | 517.387 |
NACRE 1.0.5-Hybrid (complete) | 4391510 | SAT | 1703.2 | 1703.65 |
NACRE 1.0.5 (complete) | 4391710 | ? (TO) | 2400.08 | 2400.01 |
(reference) PicatSAT 2019-09-12 (complete) | 4407687 | ? (TO) | 2400.1 | 2400.01 |
cosoco 2.0 (complete) | 4397390 | ? (TO) | 2400.1 | 2399.9 |
cosoco 2.0 (complete) | 4408650 | ? (TO) | 2400.1 | 2399.9 |
cosoco 2 (complete) | 4390110 | ? (TO) | 2400.1 | 2400.11 |
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> 7 46 61 53 43 53 17 41 29 3 5 19 31 71 7 17 2 17 41 59 30 23 19 29 5 31 5 7 19 53 29 5 5 67 29 19 43 59 37 5 29 43 3 71 11 61 67 11 53 31 43 17 37 2 59 43 5 31 59 3 13 13 11 19 59 13 17 29 43 61 11 53 5 13 47 19 47 2 7 31 19 23 59 67 23 11 7 37 47 71 41 49 52 23 71 41 17 17 47 71 </values> </instantiation>