Name | PB15eval/normalized-PB15eval/OPT-SMALLINT-NLC/ minlplib2-pb-0.1.0/opb/normalized-autocorr_bern20-03.opb |
MD5SUM | 2b5eee8ab8ca023953006616397581cf |
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 | -18 |
Best CPU time to get the best result obtained on this benchmark | 0.004999 |
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 | 38 |
Biggest coefficient in the objective function | 2 |
Number of bits for the biggest coefficient in the objective function | 2 |
Sum of the numbers in the objective function | 72 |
Number of bits of the sum of numbers in the objective function | 7 |
Biggest number in a constraint | 2 |
Number of bits of the biggest number in a constraint | 2 |
Biggest sum of numbers in a constraint | 72 |
Number of bits of the biggest sum of numbers | 7 |
Number of products (including duplicates) | 18 |
Sum of products size (including duplicates) | 36 |
Number of different products | 0 |
Sum of products size | 0 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4119579 | OPT | -18 | 0.004999 | 0.00746292 |
toysat 2016-05-02 (complete) | 4119576 | OPT | -18 | 0.024995 | 0.0273129 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4119577 | OPT | -18 | 0.594908 | 3.6492 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4119578 | OPT | -18 | 0.754884 | 0.454316 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: -18-x21 x1 -x3 -x22 x2 -x4 -x23 x5 -x24 x6 -x25 -x7 -x26 -x8 -x27 x9 -x28 x10 -x29 -x11 -x30 -x12 -x31 x13 -x32 x14 -x33 -x15 -x34 -x16 -x35 x17 -x36 x18 -x37 -x19 -x38 -x20