Name | Rlfap/Rlfap-opt/ Rlfap-scen-08-opt_c18.xml |
MD5SUM | 9be5bd0a86f9e024d7fdf548556c4b89 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 2505 |
Best CPU time to get the best result obtained on this benchmark | 251.999 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 6202 |
Number of constraints | 5744 |
Number of domains | 11 |
Minimum domain size | 2 |
Maximum domain size | 44 |
Distribution of domain sizes | [{"size":2,"count":5286},{"size":6,"count":6},{"size":22,"count":36},{"size":24,"count":8},{"size":36,"count":360},{"size":42,"count":22},{"size":44,"count":484}] |
Minimum variable degree | 1 |
Maximum variable degree | 62 |
Distribution of variable degrees | [{"degree":1,"count":12},{"degree":2,"count":5287},{"degree":3,"count":38},{"degree":4,"count":17},{"degree":5,"count":102},{"degree":6,"count":22},{"degree":7,"count":111},{"degree":8,"count":16},{"degree":9,"count":111},{"degree":10,"count":35},{"degree":11,"count":48},{"degree":12,"count":33},{"degree":13,"count":52},{"degree":14,"count":19},{"degree":15,"count":61},{"degree":16,"count":14},{"degree":17,"count":33},{"degree":18,"count":10},{"degree":19,"count":26},{"degree":20,"count":19},{"degree":21,"count":18},{"degree":22,"count":8},{"degree":23,"count":15},{"degree":24,"count":11},{"degree":25,"count":13},{"degree":26,"count":1},{"degree":27,"count":14},{"degree":28,"count":12},{"degree":29,"count":6},{"degree":30,"count":10},{"degree":31,"count":2},{"degree":32,"count":2},{"degree":34,"count":3},{"degree":35,"count":4},{"degree":36,"count":4},{"degree":37,"count":1},{"degree":38,"count":2},{"degree":39,"count":4},{"degree":42,"count":1},{"degree":43,"count":1},{"degree":44,"count":1},{"degree":47,"count":1},{"degree":55,"count":1},{"degree":62,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 3 |
Distribution of constraint arities | [{"arity":2,"count":458},{"arity":3,"count":5286}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 5744 |
Distribution of constraint types | [{"type":"intension","count":5744}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
cosoco 1.12 (complete) | 4301476 | SAT (TO) | 2505 | 251.999 | 252.025 |
Sat4j-CSP 2018-07-11 (complete) | 4301475 | SAT (TO) | 2538 | 252.152 | 234.978 |
Mistral-2.0 2018-08-01 (complete) | 4312524 | SAT (TO) | 4454 | 251.97 | 252.013 |
OscaR - Hybrid 2018-08-14 (complete) | 4310533 | ? (TO) | 252.054 | 243.033 | |
OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312393 | ? (TO) | 252.065 | 243.325 | |
OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4310183 | ? (TO) | 252.094 | 243.425 | |
Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301474 | ? (TO) | 252.106 | 242.819 | |
Concrete 3.9.2 (complete) | 4302557 | ? (TO) | 252.158 | 166.454 | |
Concrete 3.9.2-SuperNG (complete) | 4302907 | ? (TO) | 256.255 | 142.244 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 2505--too large--