| Name | Fapp/Fapp-m2s/ Fapp-m2s-test03-0400_c18.xml |
| MD5SUM | a5fe7a04cb5002912ef3d870057982e3 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 164004631 |
| Best CPU time to get the best result obtained on this benchmark | 2520.07 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 6864 |
| Number of constraints | 4370 |
| Number of domains | 85 |
| Minimum domain size | 1 |
| Maximum domain size | 175 |
| Distribution of domain sizes | [{"size":1,"count":8},{"size":2,"count":2413},{"size":11,"count":2021},{"size":12,"count":1},{"size":21,"count":15},{"size":26,"count":8},{"size":29,"count":37},{"size":31,"count":9},{"size":32,"count":9},{"size":33,"count":36},{"size":35,"count":22},{"size":37,"count":62},{"size":41,"count":51},{"size":43,"count":13},{"size":44,"count":6},{"size":47,"count":16},{"size":49,"count":20},{"size":51,"count":47},{"size":53,"count":8},{"size":55,"count":14},{"size":56,"count":16},{"size":57,"count":3},{"size":59,"count":3},{"size":61,"count":30},{"size":63,"count":21},"...",{"size":91,"count":18}, {"size":93,"count":6}, {"size":94,"count":7}, {"size":97,"count":4}, {"size":99,"count":11}, {"size":101,"count":31}, {"size":103,"count":5}, {"size":105,"count":6}, {"size":107,"count":14}, {"size":109,"count":15}, {"size":113,"count":11}, {"size":115,"count":20}, {"size":117,"count":3}, {"size":123,"count":35}, {"size":127,"count":5}, {"size":135,"count":20}, {"size":136,"count":127}, {"size":137,"count":28}, {"size":153,"count":82}, {"size":158,"count":107}, {"size":160,"count":191}, {"size":163,"count":78}, {"size":165,"count":126}, {"size":167,"count":89}, {"size":175,"count":655}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2022 |
| Distribution of variable degrees | [{"degree":2,"count":6063},{"degree":3,"count":3},{"degree":4,"count":12},{"degree":5,"count":22},{"degree":6,"count":42},{"degree":7,"count":47},{"degree":8,"count":59},{"degree":9,"count":62},{"degree":10,"count":77},{"degree":11,"count":88},{"degree":12,"count":91},{"degree":13,"count":96},{"degree":14,"count":131},{"degree":15,"count":70},{"degree":2022,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":2,"count":328},{"arity":3,"count":2021},{"arity":6,"count":2021}] |
| Number of extensional constraints | 2021 |
| Number of intensional constraints | 2349 |
| Distribution of constraint types | [{"type":"extension","count":2021},{"type":"intension","count":2349}] |
| 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: 163762036--too large--