| Name | Fapp/Fapp-m2s/ Fapp-m2s-08-0700_c18.xml |
| MD5SUM | 1726f38b1078149b3b3b5e51280bc638 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 542126384 |
| Best CPU time to get the best result obtained on this benchmark | 2521 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 11265 |
| Number of constraints | 7122 |
| Number of domains | 159 |
| Minimum domain size | 1 |
| Maximum domain size | 141 |
| Distribution of domain sizes | [{"size":1,"count":4},{"size":2,"count":3984},{"size":11,"count":3288},{"size":12,"count":1},{"size":21,"count":10},{"size":23,"count":9},{"size":27,"count":51},{"size":31,"count":72},{"size":34,"count":11},{"size":35,"count":15},{"size":37,"count":59},{"size":38,"count":4},{"size":39,"count":29},{"size":40,"count":1},{"size":41,"count":17},{"size":42,"count":10},{"size":43,"count":1},{"size":44,"count":7},{"size":45,"count":25},{"size":47,"count":11},{"size":49,"count":70},{"size":51,"count":80},{"size":52,"count":2},{"size":53,"count":2},{"size":54,"count":5},"...",{"size":104,"count":55}, {"size":105,"count":9}, {"size":106,"count":46}, {"size":107,"count":8}, {"size":108,"count":6}, {"size":109,"count":6}, {"size":111,"count":41}, {"size":112,"count":53}, {"size":113,"count":10}, {"size":114,"count":14}, {"size":115,"count":6}, {"size":117,"count":78}, {"size":118,"count":117}, {"size":119,"count":35}, {"size":127,"count":73}, {"size":128,"count":21}, {"size":129,"count":2}, {"size":130,"count":15}, {"size":131,"count":18}, {"size":133,"count":2}, {"size":135,"count":74}, {"size":136,"count":50}, {"size":137,"count":18}, {"size":140,"count":8}, {"size":141,"count":1776}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 3289 |
| Distribution of variable degrees | [{"degree":1,"count":2},{"degree":2,"count":9869},{"degree":3,"count":14},{"degree":4,"count":31},{"degree":5,"count":51},{"degree":6,"count":71},{"degree":7,"count":99},{"degree":8,"count":104},{"degree":9,"count":116},{"degree":10,"count":158},{"degree":11,"count":226},{"degree":12,"count":258},{"degree":13,"count":171},{"degree":14,"count":35},{"degree":15,"count":26},{"degree":16,"count":18},{"degree":17,"count":8},{"degree":18,"count":6},{"degree":19,"count":1},{"degree":3289,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":2,"count":546},{"arity":3,"count":3288},{"arity":6,"count":3288}] |
| Number of extensional constraints | 3288 |
| Number of intensional constraints | 3834 |
| Distribution of constraint types | [{"type":"extension","count":3288},{"type":"intension","count":3834}] |
| 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: 541961926--too large--