| Name | QRandom/QRandom-composed-s25/ composed-25-10-20-5.xml |
| MD5SUM | c48c45b7e76b5e503373b0b6aac41bc1 |
| 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.027902 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 620 |
| Number of domains | 1 |
| Minimum domain size | 10 |
| Maximum domain size | 10 |
| Distribution of domain sizes | [{"size":10,"count":105}] |
| Minimum variable degree | 4 |
| Maximum variable degree | 32 |
| Distribution of variable degrees | [{"degree":4,"count":1},{"degree":5,"count":8},{"degree":6,"count":9},{"degree":7,"count":14},{"degree":8,"count":18},{"degree":9,"count":12},{"degree":10,"count":8},{"degree":11,"count":8},{"degree":12,"count":2},{"degree":18,"count":1},{"degree":19,"count":1},{"degree":20,"count":4},{"degree":21,"count":1},{"degree":22,"count":3},{"degree":23,"count":3},{"degree":24,"count":1},{"degree":25,"count":2},{"degree":26,"count":2},{"degree":27,"count":3},{"degree":28,"count":1},{"degree":29,"count":1},{"degree":31,"count":1},{"degree":32,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":620}] |
| Number of extensional constraints | 620 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":620}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-08-10 (complete) | 4264955 | SAT | 0.027902 | 0.028604999 |
| miniBTD 2017-06-30 (complete) | 4252343 | SAT | 0.028279 | 0.0289101 |
| cosoco-mini 1.12 (complete) | 4267396 | SAT | 0.055429 | 0.0563839 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252344 | SAT | 0.055463 | 0.0560471 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260215 | SAT | 0.056125998 | 0.13431001 |
| Naxos 1.1.0 (complete) | 4252345 | ? (TO) | 2400.04 | 2399.8 |
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] x[100] x[101] x[102] x[103] x[104] </list> <values> 2 1 0 1 0 0 4 1 1 1 2 4 4 7 7 3 2 1 0 0 3 5 1 2 6 3 0 0 2 1 1 6 9 5 2 9 6 3 8 0 2 9 0 5 2 1 0 6 4 8 1 9 2 2 3 2 5 4 5 6 7 7 1 4 9 1 7 4 0 3 9 9 8 3 6 0 6 3 1 4 0 3 6 6 2 4 2 0 7 4 3 4 4 4 1 2 9 4 0 5 0 7 1 5 0 </values> </instantiation>