Name | StillLife/StillLife-m1-s1/ StillLife-04-15.xml |
MD5SUM | cca0fe077f2d073d0e0e51ff08e17328 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 32 |
Best CPU time to get the best result obtained on this benchmark | 22.5937 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 120 |
Number of constraints | 150 |
Number of domains | 2 |
Minimum domain size | 2 |
Maximum domain size | 9 |
Distribution of domain sizes | [{"size":2,"count":60},{"size":9,"count":60}] |
Minimum variable degree | 2 |
Maximum variable degree | 10 |
Distribution of variable degrees | [{"degree":2,"count":60},{"degree":7,"count":4},{"degree":8,"count":30},{"degree":10,"count":26}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 9 |
Distribution of constraint arities | [{"arity":2,"count":60},{"arity":3,"count":30},{"arity":4,"count":4},{"arity":6,"count":30},{"arity":9,"count":26}] |
Number of extensional constraints | 90 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":90},{"type":"sum","count":60}] |
Optimization problem | YES |
Type of objective | max SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 32<instantiation> <list> x[][] s[][] </list> <values> 1 1 0 1 1 0 1 1 0 1 1 0 0 1 1 0 1 0 1 0 0 0 1 0 1 0 1 0 0 1 1 0 0 0 1 0 1 0 0 1 0 1 0 1 0 1 1 0 1 1 0 1 1 0 0 1 1 0 1 1 2 2 4 2 2 2 2 2 4 2 3 2 2 2 2 4 3 4 3 4 4 4 3 5 3 6 2 4 4 3 3 4 4 4 3 4 3 4 4 2 6 3 5 3 4 2 2 2 2 2 4 2 2 2 2 3 2 4 2 2 </values> </instantiation>