| Name | Frb/ frb-50-23-2-mgd_c18.xml |
| MD5SUM | 747f749c43313802f4a8e2c3a16b0378 |
| 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 | 4847.48 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 445 |
| Number of domains | 1 |
| Minimum domain size | 23 |
| Maximum domain size | 23 |
| Distribution of domain sizes | [{"size":23,"count":50}] |
| Minimum variable degree | 10 |
| Maximum variable degree | 27 |
| Distribution of variable degrees | [{"degree":10,"count":1},{"degree":11,"count":1},{"degree":12,"count":1},{"degree":14,"count":2},{"degree":15,"count":4},{"degree":16,"count":10},{"degree":17,"count":5},{"degree":18,"count":8},{"degree":19,"count":5},{"degree":20,"count":3},{"degree":21,"count":3},{"degree":22,"count":4},{"degree":23,"count":1},{"degree":24,"count":1},{"degree":27,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":445}] |
| Number of extensional constraints | 445 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":445}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| scop order+glucose-syrup (2018-07-07) (complete) | 4297050 | SAT | 4847.48 | 612.173 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309141 | ? (TO) | 19992 | 2520.39 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291372 | ? (TO) | 19998.7 | 2520.47 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307234 | ? (TO) | 20038.7 | 2520.07 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307470 | ? (TO) | 20059.4 | 2520.08 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297286 | ? (TO) | 20066.1 | 2520.08 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297785 | ? (TO) | 20084 | 2520.13 |
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>11 22 17 5 1 14 12 22 16 3 14 12 9 20 1 11 13 3 6 21 6 16 7 0 14 22 1 18 19 11 3 14 14 3 8 10 6 13 9 14 20 12 22 12 13 21 19 6 9 9</values> </instantiation>