Name | PseudoBoolean/PseudoBoolean-dec-spng/ Pb-NG-K151.xml |
MD5SUM | e95cbc33f220035f9b7ccd0bb1eeb0b2 |
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 | 17969 |
Number of constraints | 18273 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":17969}] |
Minimum variable degree | 3 |
Maximum variable degree | 12 |
Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":279},{"degree":5,"count":1843},{"degree":6,"count":8079},{"degree":7,"count":4930},{"degree":8,"count":1940},{"degree":9,"count":598},{"degree":10,"count":149},{"degree":11,"count":1},{"degree":12,"count":149}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 151 |
Distribution of constraint arities | [{"arity":1,"count":2},{"arity":2,"count":1950},{"arity":3,"count":8100},{"arity":4,"count":4950},{"arity":5,"count":2100},{"arity":6,"count":450},{"arity":7,"count":150},{"arity":9,"count":150},{"arity":119,"count":302},{"arity":151,"count":119}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":18273}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
(reference) PicatSAT 2019-09-12 (complete) | 4407758 | ? (TO) | 2400.05 | 2400.12 |
NACRE 1.0.5 (complete) | 4391740 | ? (TO) | 2400.06 | 2400.01 |
miniBTD 19.06.16 (complete) | 4391940 | ? (TO) | 2400.08 | 2400.11 |
cosoco 2.0 (complete) | 4408680 | ? (TO) | 2400.08 | 2400.13 |
cosoco 2 (complete) | 4390140 | ? (TO) | 2400.08 | 2400.22 |
cosoco 2.0 (complete) | 4397420 | ? (TO) | 2400.09 | 2400.22 |
NACRE 1.0.5-Hybrid (complete) | 4391540 | ? (TO) | 2400.12 | 2400.66 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: