| Name | GolombRuler/GolombRuler-a4-s1/ GolombRuler-11-a4.xml |
| MD5SUM | 76cd483e3b4252a6c3494775e86c7629 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 72 |
| Best CPU time to get the best result obtained on this benchmark | 2400.08 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 11 |
| Number of constraints | 1322 |
| Number of domains | 1 |
| Minimum domain size | 501 |
| Maximum domain size | 501 |
| Distribution of domain sizes | [{"size":501,"count":11}] |
| Minimum variable degree | 451 |
| Maximum variable degree | 452 |
| Distribution of variable degrees | [{"degree":451,"count":9},{"degree":452,"count":2}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 11 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":330},{"arity":4,"count":990},{"arity":11,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1321 |
| Distribution of constraint types | [{"type":"intension","count":1321},{"type":"ordered","count":1}] |
| Optimization problem | YES |
| Type of objective | min VAR |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 72<instantiation cost = '72'> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] </list> <values> 0 3 14 16 20 41 48 53 63 71 72 </values> </instantiation>