| Name | Frb/ frb-50-23-1-mgd_c18.xml |
| MD5SUM | 89c27d49b20a714b89297264b4c82bd7 |
| 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 | 818.264 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 430 |
| Number of domains | 1 |
| Minimum domain size | 23 |
| Maximum domain size | 23 |
| Distribution of domain sizes | [{"size":23,"count":50}] |
| Minimum variable degree | 11 |
| Maximum variable degree | 24 |
| Distribution of variable degrees | [{"degree":11,"count":2},{"degree":12,"count":1},{"degree":13,"count":6},{"degree":14,"count":1},{"degree":15,"count":7},{"degree":16,"count":2},{"degree":17,"count":8},{"degree":18,"count":5},{"degree":19,"count":7},{"degree":20,"count":4},{"degree":21,"count":1},{"degree":22,"count":3},{"degree":23,"count":1},{"degree":24,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":430}] |
| Number of extensional constraints | 430 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":430}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| scop both+glucose-syrup (2018-07-07) (complete) | 4297285 | SAT | 818.264 | 107.033 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297049 | SAT | 1622.4 | 207.852 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297784 | SAT | 1751.04 | 220.514 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307469 | SAT | 3560.88 | 451.747 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307233 | SAT | 4570.85 | 578.059 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291371 | ? (TO) | 19978 | 2520.4 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309140 | ? (TO) | 19982.1 | 2520.56 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <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]</list> <values>6 5 2 13 20 4 10 21 2 9 12 2 9 14 0 15 1 19 14 13 20 5 8 7 4 13 8 9 8 9 22 14 17 7 19 5 22 21 14 21 8 8 22 9 2 4 19 22 13 17</values> </instantiation>