| Name | MagicHexagon/MagicHexagon-m1-s1/ MagicHexagon-05-m012.xml |
| MD5SUM | f25b1aae0c79188cbfab33516e563679 |
| 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 | 626.863 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 81 |
| Number of constraints | 34 |
| Number of domains | 1 |
| Minimum domain size | 61 |
| Maximum domain size | 61 |
| Distribution of domain sizes | [{"size":61,"count":61}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":0,"count":20},{"degree":4,"count":55},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 61 |
| Distribution of constraint arities | [{"arity":2,"count":6},{"arity":5,"count":6},{"arity":6,"count":6},{"arity":7,"count":6},{"arity":8,"count":6},{"arity":9,"count":3},{"arity":61,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 6 |
| Distribution of constraint types | [{"type":"intension","count":6},{"type":"allDifferent","count":1},{"type":"sum","count":27}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco 2.0 (complete) | 4397435 | SAT | 626.863 | 626.786 |
| cosoco 2.0 (complete) | 4408695 | SAT | 627.174 | 627.189 |
| cosoco 2 (complete) | 4390155 | SAT | 636.031 | 636.067 |
| miniBTD 19.06.16 (complete) | 4391955 | ? | 2400 | 2399.88 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407735 | ? (TO) | 2400.03 | 2400.01 |
| NACRE 1.0.5 (complete) | 4391755 | ? (TO) | 2400.06 | 2400.01 |
| NACRE 1.0.5-Hybrid (complete) | 4391555 | ? (TO) | 2400.1 | 2400.61 |
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][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[0][8] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[8][8] </list> <values>-5 44 43 0 40 * * * * 29 21 13 -12 37 34 * * * 5 23 11 12 26 6 39 * * 47 27 -2 25 18 -1 1 7 * 46 -10 35 28 -9 3 -6 33 2 17 14 16 -7 9 4 24 45 * 8 38 -11 10 32 -3 48 * * 15 -8 20 22 42 31 * * * 36 41 30 19 -4 * * * * </values> </instantiation>