Name | PB15eval/normalized-PB15eval/OPT-SMALLINT-NLC/ minlplib2-pb-0.1.0/opb/normalized-autocorr_bern20-05.opb |
MD5SUM | c40168132c6dbc13e94fd90f09e366ad |
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 | -104 |
Best CPU time to get the best result obtained on this benchmark | 39.52 |
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 | 207 |
Biggest coefficient in the objective function | 32 |
Number of bits for the biggest coefficient in the objective function | 6 |
Sum of the numbers in the objective function | 4096 |
Number of bits of the sum of numbers in the objective function | 13 |
Biggest number in a constraint | 32 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 4096 |
Number of bits of the biggest sum of numbers | 13 |
Number of products (including duplicates) | 187 |
Sum of products size (including duplicates) | 524 |
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) | 4119386 | OPT | -104 | 39.52 | 38.9206 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4119385 | OPT | -104 | 96.0004 | 54.7637 |
minisatp 2012-10-02 git-d91742b (complete) | 4119387 | OPT | -104 | 365.816 | 365.872 |
toysat 2016-05-02 (complete) | 4119384 | OPT | -104 | 1097.58 | 1097.75 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: -104x1 -x2 x3 x4 x5 x6 -x7 x8 x9 x10 -x11 x12 x13 x14 -x15 x16 x17 x18 -x19 x20