Name | QRandom/QRandom-reg2ext-s1/ reg-s20-p03-c20-d10-n10-l5-64.xml |
MD5SUM | 236be531fe4e5fa4d71f6d1385cbaf81 |
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 | 3.28957 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 130 |
Number of constraints | 100 |
Number of domains | 23 |
Minimum domain size | 1 |
Maximum domain size | 20 |
Distribution of domain sizes | [{"size":1,"count":20},{"size":6,"count":20},{"size":10,"count":10},{"size":20,"count":80}] |
Minimum variable degree | 1 |
Maximum variable degree | 14 |
Distribution of variable degrees | [{"degree":1,"count":40},{"degree":2,"count":80},{"degree":5,"count":1},{"degree":6,"count":1},{"degree":9,"count":1},{"degree":10,"count":3},{"degree":12,"count":3},{"degree":14,"count":1}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 3 |
Distribution of constraint arities | [{"arity":3,"count":100}] |
Number of extensional constraints | 100 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":100}] |
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: