| Name | PseudoBoolean/PseudoBoolean-dec-sptate/ Pb-Tate-K108.xml |
| MD5SUM | 2a47884be513939e719b7a1148b6038b |
| 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 | 7344 |
| Number of constraints | 7562 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":7344}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":185},{"degree":5,"count":1300},{"degree":6,"count":2879},{"degree":7,"count":1808},{"degree":8,"count":745},{"degree":9,"count":214},{"degree":10,"count":212}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 108 |
| Distribution of constraint arities | [{"arity":1,"count":2},{"arity":2,"count":1391},{"arity":3,"count":2889},{"arity":4,"count":1926},{"arity":5,"count":642},{"arity":6,"count":214},{"arity":7,"count":214},{"arity":68,"count":216},{"arity":108,"count":68}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":7562}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-08-10 (complete) | 4264948 | ? (TO) | 2400.01 | 2400.1101 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253406 | ? (TO) | 2400.02 | 2400.1 |
| Naxos 1.1.0 (complete) | 4253407 | ? (TO) | 2400.05 | 2400.21 |
| miniBTD 2017-06-30 (complete) | 4253405 | ? (TO) | 2400.05 | 2399.8 |
| cosoco-mini 1.12 (complete) | 4267389 | ? (TO) | 2400.05 | 2399.8 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260208 | ? (TO) | 2400.0701 | 2400 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: