| Name | PseudoBoolean/PseudoBoolean-dec-spng/ Pb-NG-K145.xml |
| MD5SUM | 5e6b89adf4cff092dc7bbd8ab430815e |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 17255 |
| Number of constraints | 17547 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":17255}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 12 |
| Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":273},{"degree":5,"count":1771},{"degree":6,"count":7755},{"degree":7,"count":4732},{"degree":8,"count":1862},{"degree":9,"count":574},{"degree":10,"count":143},{"degree":11,"count":1},{"degree":12,"count":143}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 145 |
| Distribution of constraint arities | [{"arity":1,"count":2},{"arity":2,"count":1872},{"arity":3,"count":7776},{"arity":4,"count":4752},{"arity":5,"count":2016},{"arity":6,"count":432},{"arity":7,"count":144},{"arity":9,"count":144},{"arity":119,"count":290},{"arity":145,"count":119}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":17547}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253392 | ? (TO) | 2400.07 | 2400.52 |
| Naxos 1.1.0 (complete) | 4253393 | ? (TO) | 2400.08 | 2400.1 |
| miniBTD 2017-06-30 (complete) | 4253391 | ? (TO) | 2400.09 | 2400 |
| miniBTD 2017-08-10 (complete) | 4264946 | ? (TO) | 2400.0901 | 2400.2 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260206 | ? (TO) | 2400.1101 | 2400.4199 |
| cosoco-mini 1.12 (complete) | 4267387 | ? (TO) | 2400.1201 | 2400.03 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: