Name | MagicHexagon/MagicHexagon-m1-s1/ MagicHexagon-11-m186.xml |
MD5SUM | 2292861bb3d975c21318ff2a994feaed |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 441 |
Number of constraints | 70 |
Number of domains | 1 |
Minimum domain size | 331 |
Maximum domain size | 331 |
Distribution of domain sizes | [{"size":331,"count":331}] |
Minimum variable degree | 0 |
Maximum variable degree | 9 |
Distribution of variable degrees | [{"degree":0,"count":110},{"degree":4,"count":325},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 331 |
Distribution of constraint arities | [{"arity":2,"count":6},{"arity":11,"count":6},{"arity":12,"count":6},{"arity":13,"count":6},{"arity":14,"count":6},{"arity":15,"count":6},{"arity":16,"count":6},{"arity":17,"count":6},{"arity":18,"count":6},{"arity":19,"count":6},{"arity":20,"count":6},{"arity":21,"count":3},{"arity":331,"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":63}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
cosoco-mini 1.1 (2017-06-27) (complete) | 4253133 | ? (TO) | 2400.02 | 2399.8 |
miniBTD 2017-08-10 (complete) | 4264870 | ? (TO) | 2400.04 | 2400.2 |
cosoco-mini 1.12 (complete) | 4267311 | ? (TO) | 2400.0601 | 2399.8999 |
Naxos 1.1.0 (complete) | 4253134 | ? (TO) | 2400.08 | 2400.1 |
miniBTD 2017-06-30 (complete) | 4253132 | ? (TO) | 2400.08 | 2400 |
cosoco-mini 1.1 (2017-07-29) (complete) | 4260130 | ? (TO) | 2400.0801 | 2399.8999 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: