| Name | Frb/ frb-53-24-2-mgd_c18.xml |
| MD5SUM | efa4ad1e7c4e0975e1666af510b5ab46 |
| 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 | 4834.31 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 53 |
| Number of constraints | 474 |
| Number of domains | 1 |
| Minimum domain size | 24 |
| Maximum domain size | 24 |
| Distribution of domain sizes | [{"size":24,"count":53}] |
| Minimum variable degree | 12 |
| Maximum variable degree | 26 |
| Distribution of variable degrees | [{"degree":12,"count":1},{"degree":14,"count":6},{"degree":15,"count":3},{"degree":16,"count":9},{"degree":17,"count":8},{"degree":18,"count":6},{"degree":19,"count":4},{"degree":20,"count":5},{"degree":21,"count":3},{"degree":22,"count":7},{"degree":26,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":474}] |
| Number of extensional constraints | 474 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":474}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| scop order+glucose-syrup (2018-07-31) (complete) | 4307237 | SAT | 4834.31 | 612.042 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297289 | SAT | 16830.9 | 2114.92 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309144 | ? (TO) | 20017.6 | 2520.34 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291375 | ? (TO) | 20019.6 | 2520.51 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307473 | ? (TO) | 20051.7 | 2520.08 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4297053 | ? (TO) | 20061.3 | 2520.08 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297788 | ? (TO) | 20093.5 | 2520.12 |
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] x[50] x[51] x[52]</list> <values>22 18 11 4 21 11 11 10 7 0 10 2 16 0 14 8 0 1 10 1 3 3 10 1 23 11 13 6 14 17 7 10 1 15 21 9 14 11 20 15 13 11 8 10 6 22 6 12 0 4 1 2 2</values> </instantiation>