Name | PeacableArmies/ PeacableArmies-m1-05_c18.xml |
MD5SUM | 4b3a1ce7a352f102282a9a722b8ddb17 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 4 |
Best CPU time to get the best result obtained on this benchmark | 1.54035 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 50 |
Number of constraints | 346 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":50}] |
Minimum variable degree | 14 |
Maximum variable degree | 19 |
Distribution of variable degrees | [{"degree":14,"count":16},{"degree":15,"count":16},{"degree":16,"count":8},{"degree":17,"count":8},{"degree":18,"count":1},{"degree":19,"count":1}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 50 |
Distribution of constraint arities | [{"arity":2,"count":345},{"arity":50,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 345 |
Distribution of constraint types | [{"type":"intension","count":345},{"type":"sum","count":1}] |
Optimization problem | YES |
Type of objective | max SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
Mistral-2.0 2018-08-01 (complete) | 4312688 | OPT | 4 | 0.268194 | 0.269279 |
cosoco 1.12 (complete) | 4301968 | OPT | 4 | 1.54035 | 1.54251 |
Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301966 | OPT | 4 | 1.91761 | 0.814785 |
Sat4j-CSP 2018-07-11 (complete) | 4301967 | OPT | 4 | 2.10689 | 1.15441 |
OscaR - Hybrid 2018-08-14 (complete) | 4310284 | OPT | 4 | 2.52527 | 1.38129 |
OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312144 | OPT | 4 | 2.53 | 1.39493 |
Concrete 3.9.2 (complete) | 4302308 | OPT | 4 | 14.1753 | 6.28639 |
Concrete 3.9.2-SuperNG (complete) | 4302658 | OPT | 4 | 15.6156 | 6.40731 |
OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309934 | SAT | 4 | 251.673 | 247.367 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 4<instantiation type="optimum" cost="4"> <list> b[0][0] b[0][1] b[0][2] b[0][3] b[0][4] b[1][0] b[1][1] b[1][2] b[1][3] b[1][4] b[2][0] b[2][1] b[2][2] b[2][3] b[2][4] b[3][0] b[3][1] b[3][2] b[3][3] b[3][4] b[4][0] b[4][1] b[4][2] b[4][3] b[4][4] w[0][0] w[0][1] w[0][2] w[0][3] w[0][4] w[1][0] w[1][1] w[1][2] w[1][3] w[1][4] w[2][0] w[2][1] w[2][2] w[2][3] w[2][4] w[3][0] w[3][1] w[3][2] w[3][3] w[3][4] w[4][0] w[4][1] w[4][2] w[4][3] w[4][4] </list> <values> 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 </values> </instantiation>