Name | PB15eval/normalized-PB15eval/OPT-SMALLINT-NLC/ minlplib2-pb-0.1.0/opb/normalized-edgecross10-030.opb |
MD5SUM | 88f041e88c3fe18f295c28f6b14bb355 |
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 | 55 |
Best CPU time to get the best result obtained on this benchmark | 1801.31 |
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 | 91 |
Total number of constraints | 481 |
Number of constraints which are clauses | 480 |
Number of constraints which are cardinality constraints (but not clauses) | 1 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 3 |
Number of terms in the objective function | 400 |
Biggest coefficient in the objective function | 184 |
Number of bits for the biggest coefficient in the objective function | 8 |
Sum of the numbers in the objective function | 1112 |
Number of bits of the sum of numbers in the objective function | 11 |
Biggest number in a constraint | 184 |
Number of bits of the biggest number in a constraint | 8 |
Biggest sum of numbers in a constraint | 1112 |
Number of bits of the biggest sum of numbers | 11 |
Number of products (including duplicates) | 317 |
Sum of products size (including duplicates) | 634 |
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) | 4119333 | SAT (TO) | 55 | 1801.31 | 932.635 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4119334 | SAT (TO) | 56 | 1804.79 | 1792.53 |
minisatp 2012-10-02 git-d91742b (complete) | 4119335 | SAT (TO) | 60 | 1800.01 | 1800.3 |
toysat 2016-05-02 (complete) | 4119332 | ? (TO) | 1800.05 | 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: 55-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 x61 -x62 x63 x64 x65 x66 -x67 x68 -x69 x70 x71 x72 -x73 x74 -x75 x76 x77 -x78 x79 -x80 -x81 -x82 -x83 -x84 -x85 -x86 -x87 x88 -x89 -x90 x91