Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/ manquinho/bsg/normalized-bsg_10_4_1.opb |
MD5SUM | 2f2a65bac822fb15bab629a6de652836 |
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 | -3 |
Best CPU time to get the best result obtained on this benchmark | 0.008997 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | -3 |
Optimality of the best value was proved | YES |
Number of variables | 20 |
Total number of constraints | 31 |
Number of constraints which are clauses | 10 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 21 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 20 |
Number of terms in the objective function | 10 |
Biggest coefficient in the objective function | 1 |
Number of bits for the biggest coefficient in the objective function | 1 |
Sum of the numbers in the objective function | 10 |
Number of bits of the sum of numbers in the objective function | 4 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 20 |
Number of bits of the biggest sum of numbers | 5 |
Number of products (including duplicates) | 96 |
Sum of products size (including duplicates) | 192 |
Number of different products | 48 |
Sum of products size | 96 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4113017 | OPT | -3 | 0.008997 | 0.009012 |
toysat 2016-05-02 (complete) | 4080095 | OPT | -3 | 0.041992 | 0.0419579 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4085801 | OPT | -3 | 0.302953 | 0.215528 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4081721 | OPT | -3 | 0.662899 | 1.6622 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: -3x1 -x2 -x3 -x4 x5 -x6 -x7 x8 -x9 -x10 -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 -x11 x12 -x13 -x14 -x15 -x16 -x17 -x18 x19 x20