Name | PseudoBoolean/PseudoBoolean-dec-spng/ Pb-NG-K138.xml |
MD5SUM | d1127b901f05c0465fc5ca2bd763ec4c |
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 | 16422 |
Number of constraints | 16700 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":16422}] |
Minimum variable degree | 3 |
Maximum variable degree | 12 |
Distribution of variable degrees | [{"degree":3,"count":1},{"degree":4,"count":266},{"degree":5,"count":1687},{"degree":6,"count":7377},{"degree":7,"count":4501},{"degree":8,"count":1771},{"degree":9,"count":546},{"degree":10,"count":136},{"degree":11,"count":1},{"degree":12,"count":136}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 138 |
Distribution of constraint arities | [{"arity":1,"count":2},{"arity":2,"count":1781},{"arity":3,"count":7398},{"arity":4,"count":4521},{"arity":5,"count":1918},{"arity":6,"count":411},{"arity":7,"count":137},{"arity":9,"count":137},{"arity":119,"count":276},{"arity":138,"count":119}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":16700}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
(reference) PicatSAT 2019-09-12 (complete) | 4407760 | ? (TO) | 2400.01 | 2400.21 |
miniBTD 19.06.16 (complete) | 4391930 | ? (TO) | 2400.03 | 2399.8 |
cosoco 2 (complete) | 4390130 | ? (TO) | 2400.03 | 2399.81 |
NACRE 1.0.5 (complete) | 4391730 | ? (TO) | 2400.06 | 2400.01 |
cosoco 2.0 (complete) | 4408670 | ? (TO) | 2400.09 | 2400.21 |
cosoco 2.0 (complete) | 4397410 | ? (TO) | 2400.09 | 2400.31 |
NACRE 1.0.5-Hybrid (complete) | 4391530 | ? (TO) | 2400.22 | 2400.65 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: