| Name | GolombRuler/GolombRuler-a4-s1/ GolombRuler-21-a4.xml |
| MD5SUM | 982ba5645f5cd940fa49e525f3796150 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 432 |
| Best CPU time to get the best result obtained on this benchmark | 249.993 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 21 |
| Number of constraints | 20617 |
| Number of domains | 1 |
| Minimum domain size | 1001 |
| Maximum domain size | 1001 |
| Distribution of domain sizes | [{"size":1001,"count":21}] |
| Minimum variable degree | 3801 |
| Maximum variable degree | 3802 |
| Distribution of variable degrees | [{"degree":3801,"count":19},{"degree":3802,"count":2}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 21 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":2660},{"arity":4,"count":17955},{"arity":21,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 20616 |
| Distribution of constraint types | [{"type":"intension","count":20616},{"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: 432<instantiation> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] </list> <values> 0 1 3 7 12 20 30 44 65 80 96 134 167 206 234 276 325 350 384 406 432 </values> </instantiation>