| Name | QRandom/QRandom-m1-lard/ lard-85-85.xml |
| MD5SUM | ba1c49fa80fd17c1a348725aa5db0d15 |
| 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 | 33.132702 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 85 |
| Number of constraints | 3570 |
| Number of domains | 1 |
| Minimum domain size | 86 |
| Maximum domain size | 86 |
| Distribution of domain sizes | [{"size":86,"count":85}] |
| Minimum variable degree | 84 |
| Maximum variable degree | 84 |
| Distribution of variable degrees | [{"degree":84,"count":85}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":3570}] |
| Number of extensional constraints | 3570 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":3570}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-06-30 (complete) | 4252292 | SAT | 7.66285 | 7.66318 |
| miniBTD 2017-08-10 (complete) | 4264966 | SAT | 7.72048 | 7.7216601 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252293 | SAT | 32.8553 | 32.8562 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260226 | SAT | 32.975101 | 33.041698 |
| cosoco-mini 1.12 (complete) | 4267407 | SAT | 33.132702 | 33.131001 |
| Naxos 1.1.0 (complete) | 4252294 | SAT | 43.5763 | 43.5815 |
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] </list> <values> 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 </values> </instantiation>