Name | PB15eval/normalized-PB15eval/OPT-SMALLINT-NLC/ minlplib2-pb-0.1.0/opb/normalized-autocorr_bern20-10.opb |
MD5SUM | 8faeafd4522941f3cd1a1687d7dbf9a7 |
Bench Category | OPT-SMALLINT-NLC (optimisation, small integers, non linear constraints) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | -367 |
Best CPU time to get the best result obtained on this benchmark | 210.155 |
Has Objective Function | YES |
Satisfiable | |
(Un)Satisfiability was proved | |
Best value of the objective function | |
Optimality of the best value was proved | |
Number of variables | 0 |
Total number of constraints | 0 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | -1 |
Maximum length of a constraint | 0 |
Number of terms in the objective function | 833 |
Biggest coefficient in the objective function | 220 |
Number of bits for the biggest coefficient in the objective function | 8 |
Sum of the numbers in the objective function | 22440 |
Number of bits of the sum of numbers in the objective function | 15 |
Biggest number in a constraint | 220 |
Number of bits of the biggest number in a constraint | 8 |
Biggest sum of numbers in a constraint | 22440 |
Number of bits of the biggest sum of numbers | 15 |
Number of products (including duplicates) | 813 |
Sum of products size (including duplicates) | 2514 |
Number of different products | 0 |
Sum of products size | 0 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4119530 | OPT | -367 | 210.155 | 206.231 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4119529 | OPT | -367 | 572.076 | 315.935 |
minisatp 2012-10-02 git-d91742b (complete) | 4119531 | SAT (TO) | -367 | 1800.02 | 1800.3 |
toysat 2016-05-02 (complete) | 4119528 | ? (TO) | 1800.09 | 1800.52 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: -367-x1 x2 x3 -x4 -x5 x6 -x7 x8 x9 x10 x11 x12 -x13 -x14 x15 -x16 x17 -x18 -x19 -x20