| Name | Fapp/Fapp-m2s/ Fapp-m2s-07-0600_c18.xml |
| MD5SUM | 0ae5362fc8ec35126a2a174beba608b8 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 1603939205 |
| Best CPU time to get the best result obtained on this benchmark | 2520.11 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 13855 |
| Number of constraints | 8996 |
| Number of domains | 202 |
| Minimum domain size | 1 |
| Maximum domain size | 151 |
| Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":4816},{"size":11,"count":4218},{"size":12,"count":1},{"size":21,"count":9},{"size":23,"count":10},{"size":25,"count":44},{"size":29,"count":37},{"size":31,"count":2},{"size":32,"count":3},{"size":33,"count":37},{"size":34,"count":12},{"size":35,"count":9},{"size":36,"count":11},{"size":37,"count":13},{"size":38,"count":8},{"size":39,"count":37},{"size":40,"count":13},{"size":41,"count":28},{"size":42,"count":21},{"size":43,"count":32},{"size":44,"count":30},{"size":45,"count":18},{"size":46,"count":11},{"size":48,"count":13},"...",{"size":119,"count":4}, {"size":120,"count":3}, {"size":121,"count":17}, {"size":123,"count":97}, {"size":125,"count":18}, {"size":126,"count":17}, {"size":127,"count":42}, {"size":128,"count":76}, {"size":130,"count":61}, {"size":131,"count":88}, {"size":132,"count":46}, {"size":133,"count":30}, {"size":135,"count":53}, {"size":136,"count":94}, {"size":137,"count":43}, {"size":138,"count":8}, {"size":139,"count":29}, {"size":141,"count":5}, {"size":143,"count":122}, {"size":144,"count":136}, {"size":145,"count":57}, {"size":147,"count":60}, {"size":148,"count":54}, {"size":150,"count":21}, {"size":151,"count":1165}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4219 |
| Distribution of variable degrees | [{"degree":2,"count":12654},{"degree":3,"count":1},{"degree":4,"count":10},{"degree":5,"count":17},{"degree":6,"count":18},{"degree":7,"count":18},{"degree":8,"count":40},{"degree":9,"count":42},{"degree":10,"count":76},{"degree":11,"count":64},{"degree":12,"count":63},{"degree":13,"count":48},{"degree":14,"count":63},{"degree":15,"count":70},{"degree":16,"count":93},{"degree":17,"count":127},{"degree":18,"count":153},{"degree":19,"count":186},{"degree":20,"count":110},{"degree":21,"count":1},{"degree":4219,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":2,"count":560},{"arity":3,"count":4218},{"arity":6,"count":4218}] |
| Number of extensional constraints | 4218 |
| Number of intensional constraints | 4778 |
| Distribution of constraint types | [{"type":"extension","count":4218},{"type":"intension","count":4778}] |
| 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: 1603938833--too large--