| Name | GolombRuler/GolombRuler-a4-s1/ GolombRuler-13-a4.xml |
| MD5SUM | a23d33c916089316ecf00e2bfba5f26c |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 114 |
| Best CPU time to get the best result obtained on this benchmark | 258.901 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 13 |
| Number of constraints | 2719 |
| Number of domains | 1 |
| Minimum domain size | 501 |
| Maximum domain size | 501 |
| Distribution of domain sizes | [{"size":501,"count":13}] |
| Minimum variable degree | 793 |
| Maximum variable degree | 794 |
| Distribution of variable degrees | [{"degree":793,"count":11},{"degree":794,"count":2}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 13 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":572},{"arity":4,"count":2145},{"arity":13,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 2718 |
| Distribution of constraint types | [{"type":"intension","count":2718},{"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: 114<instantiation cost="114"> <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] </list> <values> 0 2 6 21 24 56 63 73 89 100 101 109 114 </values> </instantiation>