Name | Random/Random-RB-3-24-24f/ rand-3-24-24-76-632f-49.xml |
MD5SUM | eb1071698302cc934647f3ac3e5db9c3 |
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 | 410.687 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 24 |
Number of constraints | 73 |
Number of domains | 1 |
Minimum domain size | 24 |
Maximum domain size | 24 |
Distribution of domain sizes | [{"size":24,"count":24}] |
Minimum variable degree | 5 |
Maximum variable degree | 15 |
Distribution of variable degrees | [{"degree":5,"count":2},{"degree":6,"count":3},{"degree":7,"count":2},{"degree":8,"count":4},{"degree":9,"count":3},{"degree":10,"count":3},{"degree":11,"count":3},{"degree":12,"count":1},{"degree":13,"count":1},{"degree":15,"count":2}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 3 |
Distribution of constraint arities | [{"arity":3,"count":73}] |
Number of extensional constraints | 73 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":73}] |
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> <list> x[] </list> <values> 18 3 17 22 0 19 9 17 15 7 2 18 7 4 4 2 13 18 9 11 6 23 14 22 </values> </instantiation>