Name | PB15eval/normalized-PB15eval/OPT-SMALLINT-NLC/ minlplib2-pb-0.1.0/opb/normalized-hmittelman.opb |
MD5SUM | 58c1ba6be131fc995f3330dab5e6923b |
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 | 13 |
Best CPU time to get the best result obtained on this benchmark | 0.003998 |
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 | 16 |
Total number of constraints | 7 |
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 | 7 |
Minimum length of a constraint | 5 |
Maximum length of a constraint | 7 |
Number of terms in the objective function | 9 |
Biggest coefficient in the objective function | 12 |
Number of bits for the biggest coefficient in the objective function | 4 |
Sum of the numbers in the objective function | 50 |
Number of bits of the sum of numbers in the objective function | 6 |
Biggest number in a constraint | 15 |
Number of bits of the biggest number in a constraint | 4 |
Biggest sum of numbers in a constraint | 61 |
Number of bits of the biggest sum of numbers | 6 |
Number of products (including duplicates) | 51 |
Sum of products size (including duplicates) | 250 |
Number of different products | 10 |
Sum of products size | 48 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4119399 | OPT | 13 | 0.003998 | 0.0070439 |
toysat 2016-05-02 (complete) | 4119396 | OPT | 13 | 0.019996 | 0.0208439 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4119398 | OPT | 13 | 0.165973 | 0.145361 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4119397 | OPT | 13 | 0.18497 | 1.64066 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 13-x17 -x18 x19 x20 -x21 -x22 -x23 -x24 -x25 -x26 -x1 -x2 x3 x4 x8 x11 -x12 x6 x7 -x5 -x9 x10 x14 x15 x16 -x13