Name | PseudoBoolean/PseudoBoolean-dec-spng/ Pb-NG-K152.xml |
MD5SUM | 148cc1c525306be86034ad988a5e8607 |
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 | 18088 |
Number of constraints | 18394 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":18088}] |
Minimum variable degree | 3 |
Maximum variable degree | 12 |
Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":280},{"degree":5,"count":1855},{"degree":6,"count":8133},{"degree":7,"count":4963},{"degree":8,"count":1953},{"degree":9,"count":602},{"degree":10,"count":150},{"degree":11,"count":1},{"degree":12,"count":150}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 152 |
Distribution of constraint arities | [{"arity":1,"count":2},{"arity":2,"count":1963},{"arity":3,"count":8154},{"arity":4,"count":4983},{"arity":5,"count":2114},{"arity":6,"count":453},{"arity":7,"count":151},{"arity":9,"count":151},{"arity":119,"count":304},{"arity":152,"count":119}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":18394}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
miniBTD 19.06.16 (complete) | 4391948 | ? (TO) | 2400.01 | 2399.8 |
(reference) PicatSAT 2019-09-12 (complete) | 4407759 | ? (TO) | 2400.06 | 2400.2 |
cosoco 2.0 (complete) | 4408688 | ? (TO) | 2400.07 | 2400.07 |
cosoco 2 (complete) | 4390148 | ? (TO) | 2400.07 | 2400.32 |
NACRE 1.0.5 (complete) | 4391748 | ? (TO) | 2400.1 | 2399.9 |
NACRE 1.0.5-Hybrid (complete) | 4391548 | ? (TO) | 2400.11 | 2400.48 |
cosoco 2.0 (complete) | 4397428 | ? (TO) | 2400.12 | 2400.42 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: