| Name | Fapp/Fapp-m2s/ Fapp-m2s-06-0500_c18.xml |
| MD5SUM | 26cacd4a9bde3a1253c36df99f6e4e09 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 840126924 |
| Best CPU time to get the best result obtained on this benchmark | 2520.18 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 10160 |
| Number of constraints | 6531 |
| Number of domains | 106 |
| Minimum domain size | 2 |
| Maximum domain size | 145 |
| Distribution of domain sizes | [{"size":2,"count":3553},{"size":11,"count":3053},{"size":12,"count":1},{"size":21,"count":9},{"size":23,"count":9},{"size":27,"count":52},{"size":35,"count":16},{"size":38,"count":8},{"size":40,"count":2},{"size":41,"count":37},{"size":43,"count":6},{"size":44,"count":11},{"size":47,"count":21},{"size":49,"count":6},{"size":51,"count":47},{"size":52,"count":4},{"size":53,"count":30},{"size":54,"count":5},{"size":55,"count":1},{"size":60,"count":9},{"size":62,"count":1},{"size":63,"count":27},{"size":65,"count":4},{"size":66,"count":19},{"size":67,"count":33},"...",{"size":102,"count":4}, {"size":103,"count":90}, {"size":104,"count":17}, {"size":105,"count":47}, {"size":107,"count":63}, {"size":108,"count":9}, {"size":109,"count":6}, {"size":111,"count":2}, {"size":112,"count":15}, {"size":113,"count":24}, {"size":116,"count":10}, {"size":117,"count":31}, {"size":119,"count":112}, {"size":120,"count":118}, {"size":121,"count":1}, {"size":122,"count":56}, {"size":129,"count":2}, {"size":131,"count":39}, {"size":132,"count":4}, {"size":133,"count":22}, {"size":136,"count":37}, {"size":138,"count":41}, {"size":139,"count":70}, {"size":140,"count":148}, {"size":145,"count":1779}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3054 |
| Distribution of variable degrees | [{"degree":2,"count":9160},{"degree":3,"count":4},{"degree":4,"count":4},{"degree":5,"count":14},{"degree":6,"count":18},{"degree":7,"count":34},{"degree":8,"count":46},{"degree":9,"count":47},{"degree":10,"count":58},{"degree":11,"count":53},{"degree":12,"count":75},{"degree":13,"count":101},{"degree":14,"count":110},{"degree":15,"count":138},{"degree":16,"count":215},{"degree":17,"count":78},{"degree":18,"count":3},{"degree":19,"count":1},{"degree":3054,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":2,"count":425},{"arity":3,"count":3053},{"arity":6,"count":3053}] |
| Number of extensional constraints | 3053 |
| Number of intensional constraints | 3478 |
| Distribution of constraint types | [{"type":"extension","count":3053},{"type":"intension","count":3478}] |
| 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: 560654021--too large--