Name | PB15eval/normalized-PB15eval/OPT-SMALLINT-NLC/ minlplib2-pb-0.1.0/opb/normalized-graphpart_clique-20.opb |
MD5SUM | f8fcb3375756150bbf7abfd66b9ecade |
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 | 147 |
Best CPU time to get the best result obtained on this benchmark | 48.0467 |
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 | 60 |
Total number of constraints | 20 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 20 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 3 |
Maximum length of a constraint | 3 |
Number of terms in the objective function | 570 |
Biggest coefficient in the objective function | 19 |
Number of bits for the biggest coefficient in the objective function | 5 |
Sum of the numbers in the objective function | 3990 |
Number of bits of the sum of numbers in the objective function | 12 |
Biggest number in a constraint | 19 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 3990 |
Number of bits of the biggest sum of numbers | 12 |
Number of products (including duplicates) | 570 |
Sum of products size (including duplicates) | 1140 |
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) | 4119414 | OPT | 147 | 48.0467 | 46.7777 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4119413 | OPT | 147 | 124.984 | 61.6499 |
minisatp 2012-10-02 git-d91742b (complete) | 4119415 | SAT (TO) | 189 | 1800.02 | 1800.3 |
toysat 2016-05-02 (complete) | 4119412 | ? (TO) | 1800.1 | 1800.61 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 147-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 -x41 x42 x43 -x44 -x45 x46 -x47 -x48 x49 -x50 -x51 x52 -x53 -x54 x55 -x56 -x57 x58 -x59 -x60