| Name | BusScheduling/BusScheduling-cnt-s1/ BusScheduling-cnt-r3.xml |
| MD5SUM | 35e588148f794a6a4a81576d123b10dc |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 19091 |
| Number of constraints | 160 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":19091}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 19 |
| Distribution of variable degrees | [{"degree":3,"count":10},{"degree":4,"count":86},{"degree":5,"count":309},{"degree":6,"count":636},{"degree":7,"count":911},{"degree":8,"count":1069},{"degree":9,"count":1258},{"degree":10,"count":1321},{"degree":11,"count":1446},{"degree":12,"count":1732},{"degree":13,"count":2126},{"degree":14,"count":2492},{"degree":15,"count":3123},{"degree":16,"count":1856},{"degree":17,"count":628},{"degree":18,"count":85},{"degree":19,"count":3}] |
| Minimum constraint arity | 13 |
| Maximum constraint arity | 4379 |
| Distribution of constraint arities | [{"arity":13,"count":2},{"arity":140,"count":2},{"arity":176,"count":1},{"arity":182,"count":2},{"arity":212,"count":2},{"arity":214,"count":2},{"arity":221,"count":2},{"arity":222,"count":2},{"arity":271,"count":1},{"arity":273,"count":2},{"arity":275,"count":3},{"arity":280,"count":1},{"arity":282,"count":1},{"arity":291,"count":3},{"arity":301,"count":4},{"arity":304,"count":3},{"arity":307,"count":5},{"arity":341,"count":3},{"arity":352,"count":1},{"arity":393,"count":2},{"arity":421,"count":3},{"arity":438,"count":2},{"arity":441,"count":2},{"arity":449,"count":1},{"arity":458,"count":2},"...",{"arity":2907,"count":1}, {"arity":2936,"count":1}, {"arity":3201,"count":1}, {"arity":3393,"count":1}, {"arity":3498,"count":1}, {"arity":3551,"count":1}, {"arity":3656,"count":1}, {"arity":3814,"count":1}, {"arity":3816,"count":1}, {"arity":3827,"count":1}, {"arity":3932,"count":1}, {"arity":3961,"count":1}, {"arity":4014,"count":1}, {"arity":4038,"count":1}, {"arity":4066,"count":1}, {"arity":4072,"count":1}, {"arity":4078,"count":1}, {"arity":4125,"count":1}, {"arity":4146,"count":1}, {"arity":4162,"count":1}, {"arity":4242,"count":1}, {"arity":4283,"count":1}, {"arity":4304,"count":1}, {"arity":4369,"count":1}, {"arity":4379,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"count","count":160}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: