Name | PB15eval/normalized-PB15eval/OPT-SMALLINT-NLC/ minlplib2-pb-0.1.0/opb/normalized-autocorr_bern40-05.opb |
MD5SUM | 450f236c890f723bb734ab92dd0408b5 |
Bench Category | OPT-SMALLINT-NLC (optimisation, small integers, non linear constraints) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | -219 |
Best CPU time to get the best result obtained on this benchmark | 1800.05 |
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 | 447 |
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 | 9216 |
Number of bits of the sum of numbers in the objective function | 14 |
Biggest number in a constraint | 32 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 9216 |
Number of bits of the biggest sum of numbers | 14 |
Number of products (including duplicates) | 407 |
Sum of products size (including duplicates) | 1144 |
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 Res+CP PB16 (complete) | 4119389 | SAT (TO) | -219 | 1800.05 | 904.553 |
minisatp 2012-10-02 git-d91742b (complete) | 4119391 | SAT (TO) | -213 | 1800.02 | 1800.3 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4119390 | SAT (TO) | -208 | 1800.7 | 1789.64 |
toysat 2016-05-02 (complete) | 4119388 | ? (TO) | 1800.01 | 1800.51 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: -219-x1 -x2 -x3 x4 -x5 x6 x7 x8 -x9 x10 x11 x12 x13 x14 -x15 -x16 -x17 -x18 x19 -x20 -x21 -x22 x23 -x24 -x25 -x26 x27 -x28 -x29 -x30 -x31 x32 -x33 -x34 -x35 x36 -x37 -x38 x39 x40