| Name | Fapp/Fapp-m2s/ Fapp-m2s-03-0300_c18.xml |
| MD5SUM | f3b5e910cdd6f892615a29b96bfa015e |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 294770329 |
| Best CPU time to get the best result obtained on this benchmark | 2520.17 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 6750 |
| Number of constraints | 4376 |
| Number of domains | 77 |
| Minimum domain size | 2 |
| Maximum domain size | 125 |
| Distribution of domain sizes | [{"size":2,"count":2350},{"size":11,"count":2050},{"size":12,"count":1},{"size":21,"count":20},{"size":23,"count":62},{"size":24,"count":4},{"size":25,"count":49},{"size":26,"count":11},{"size":27,"count":33},{"size":28,"count":8},{"size":29,"count":15},{"size":30,"count":3},{"size":31,"count":15},{"size":32,"count":17},{"size":33,"count":16},{"size":34,"count":5},{"size":35,"count":3},{"size":41,"count":2},{"size":43,"count":13},{"size":45,"count":4},{"size":47,"count":7},{"size":53,"count":13},{"size":54,"count":6},{"size":55,"count":19},{"size":57,"count":5},"...",{"size":71,"count":29}, {"size":72,"count":7}, {"size":73,"count":9}, {"size":74,"count":18}, {"size":75,"count":1}, {"size":76,"count":6}, {"size":77,"count":1}, {"size":78,"count":10}, {"size":79,"count":27}, {"size":81,"count":44}, {"size":84,"count":2}, {"size":90,"count":3}, {"size":91,"count":13}, {"size":99,"count":2}, {"size":101,"count":36}, {"size":102,"count":77}, {"size":105,"count":10}, {"size":113,"count":152}, {"size":114,"count":176}, {"size":115,"count":87}, {"size":117,"count":87}, {"size":119,"count":37}, {"size":121,"count":82}, {"size":124,"count":46}, {"size":125,"count":1037}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2051 |
| Distribution of variable degrees | [{"degree":2,"count":6148},{"degree":3,"count":1},{"degree":4,"count":1},{"degree":5,"count":5},{"degree":6,"count":11},{"degree":7,"count":12},{"degree":8,"count":20},{"degree":9,"count":18},{"degree":10,"count":21},{"degree":11,"count":30},{"degree":12,"count":39},{"degree":13,"count":45},{"degree":14,"count":47},{"degree":15,"count":54},{"degree":16,"count":61},{"degree":17,"count":83},{"degree":18,"count":104},{"degree":19,"count":49},{"degree":2051,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":2,"count":277},{"arity":3,"count":2049},{"arity":6,"count":2050}] |
| Number of extensional constraints | 2050 |
| Number of intensional constraints | 2326 |
| Distribution of constraint types | [{"type":"extension","count":2050},{"type":"intension","count":2326}] |
| 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: 294524152--too large--