Name | MagicHexagon/MagicHexagon-m1-s1/ MagicHexagon-04-m018.xml |
MD5SUM | e1b631bab6f8bd4ad65377e678a0b81e |
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 | 2.54992 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 49 |
Number of constraints | 28 |
Number of domains | 1 |
Minimum domain size | 37 |
Maximum domain size | 37 |
Distribution of domain sizes | [{"size":37,"count":37}] |
Minimum variable degree | 0 |
Maximum variable degree | 9 |
Distribution of variable degrees | [{"degree":0,"count":12},{"degree":4,"count":31},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 37 |
Distribution of constraint arities | [{"arity":2,"count":6},{"arity":4,"count":6},{"arity":5,"count":6},{"arity":6,"count":6},{"arity":7,"count":3},{"arity":37,"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":21}] |
Optimization problem | NO |
Type of objective |
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[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] </list> <values>-16 14 17 -15 * * * -1 -3 -7 -4 15 * * 9 6 1 4 -2 -18 * 8 -8 -5 -6 -10 3 18 -9 5 2 0 16 -14 * -11 7 10 11 -17 * * 12 -13 -12 13 * * * </values> </instantiation>