Name | PseudoBoolean/PseudoBoolean-dec-spng/ Pb-NG-K171.xml |
MD5SUM | fad44a9d187d2d79449e3ca32a08f321 |
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 | 20349 |
Number of constraints | 20693 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":20349}] |
Minimum variable degree | 3 |
Maximum variable degree | 12 |
Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":299},{"degree":5,"count":2083},{"degree":6,"count":9159},{"degree":7,"count":5590},{"degree":8,"count":2200},{"degree":9,"count":678},{"degree":10,"count":169},{"degree":11,"count":1},{"degree":12,"count":169}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 171 |
Distribution of constraint arities | [{"arity":1,"count":2},{"arity":2,"count":2210},{"arity":3,"count":9180},{"arity":4,"count":5610},{"arity":5,"count":2380},{"arity":6,"count":510},{"arity":7,"count":170},{"arity":9,"count":170},{"arity":119,"count":342},{"arity":171,"count":119}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":20693}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
NACRE 1.0.5 (complete) | 4391758 | ? (TO) | 2400.02 | 2400.11 |
(reference) PicatSAT 2019-09-12 (complete) | 4407761 | ? (TO) | 2400.03 | 2400.31 |
cosoco 2.0 (complete) | 4397438 | ? (TO) | 2400.03 | 2400.31 |
cosoco 2.0 (complete) | 4408698 | ? (TO) | 2400.06 | 2399.81 |
miniBTD 19.06.16 (complete) | 4391958 | ? (TO) | 2400.12 | 2400.01 |
cosoco 2 (complete) | 4390158 | ? (TO) | 2400.13 | 2399.85 |
NACRE 1.0.5-Hybrid (complete) | 4391558 | ? (TO) | 2400.15 | 2400.57 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: