Name | Frb/ frb-56-25-3-mgd_c18.xml |
MD5SUM | 7c69722bcd82b7b6de23ca1e1f99c5f4 |
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 | 210.887 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 56 |
Number of constraints | 511 |
Number of domains | 1 |
Minimum domain size | 25 |
Maximum domain size | 25 |
Distribution of domain sizes | [{"size":25,"count":56}] |
Minimum variable degree | 12 |
Maximum variable degree | 26 |
Distribution of variable degrees | [{"degree":12,"count":1},{"degree":13,"count":2},{"degree":14,"count":4},{"degree":15,"count":7},{"degree":16,"count":4},{"degree":17,"count":4},{"degree":18,"count":10},{"degree":19,"count":5},{"degree":20,"count":5},{"degree":21,"count":5},{"degree":22,"count":2},{"degree":23,"count":4},{"degree":24,"count":1},{"degree":25,"count":1},{"degree":26,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 2 |
Distribution of constraint arities | [{"arity":2,"count":511}] |
Number of extensional constraints | 511 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":511}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
scop order+glucose-syrup (2018-07-07) (complete) | 4297057 | SAT | 210.887 | 32.025 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297293 | SAT | 5065.37 | 640.755 |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291379 | ? (TO) | 19985 | 2520.34 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309148 | ? (TO) | 19995.7 | 2520.41 |
scop both+glucose-syrup (2018-07-31) (complete) | 4307477 | ? (TO) | 20042.9 | 2520.07 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307241 | ? (TO) | 20050 | 2520.07 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297792 | ? (TO) | 20086.6 | 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] x[53] x[54] x[55]</list> <values>19 16 2 9 2 7 8 6 5 21 21 21 16 6 12 0 14 18 1 15 14 8 9 0 3 20 14 14 2 24 13 8 24 12 22 10 15 2 17 18 17 12 3 23 14 24 6 23 4 20 8 12 8 23 2 15</values> </instantiation>