| Name | PseudoBoolean/PseudoBoolean-dec-sptate/ Pb-Tate-K097.xml |
| MD5SUM | c736c64a10dc2dd55507b217b8552514 |
| 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 | 6596 |
| Number of constraints | 6792 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":6596}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":174},{"degree":5,"count":1168},{"degree":6,"count":2582},{"degree":7,"count":1621},{"degree":8,"count":668},{"degree":9,"count":192},{"degree":10,"count":190}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 97 |
| Distribution of constraint arities | [{"arity":1,"count":2},{"arity":2,"count":1248},{"arity":3,"count":2592},{"arity":4,"count":1728},{"arity":5,"count":576},{"arity":6,"count":192},{"arity":7,"count":192},{"arity":68,"count":194},{"arity":97,"count":68}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":6792}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-08-10 (complete) | 4264947 | ? (TO) | 2400.05 | 2400.3 |
| cosoco-mini 1.12 (complete) | 4267388 | ? (TO) | 2400.0601 | 2400.2 |
| Naxos 1.1.0 (complete) | 4253404 | ? (TO) | 2400.08 | 2399.8 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253403 | ? (TO) | 2400.09 | 2399.9 |
| miniBTD 2017-06-30 (complete) | 4253402 | ? (TO) | 2400.09 | 2399.9 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260207 | ? (TO) | 2400.0901 | 2400 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: