Name | Sat/Sat-m1-various/ hole-10.xml |
MD5SUM | 9520e39dbeb812da3aa0c7bffde6870d |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 51.6093 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 110 |
Number of constraints | 561 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":110}] |
Minimum variable degree | 11 |
Maximum variable degree | 11 |
Distribution of variable degrees | [{"degree":11,"count":110}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 10 |
Distribution of constraint arities | [{"arity":2,"count":550},{"arity":10,"count":11}] |
Number of extensional constraints | 561 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":561}] |
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: