Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/ factor-mod-B/factor-mod-size=8-P0=179-P1=37-B.opb |
MD5SUM | 7c55947c8932da669a6320e0df24c1e1 |
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.019996 |
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 | 24 |
Total number of constraints | 3 |
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 | 3 |
Minimum length of a constraint | 8 |
Maximum length of a constraint | 72 |
Number of terms in the objective function | 8 |
Biggest coefficient in the objective function | 128 |
Number of bits for the biggest coefficient in the objective function | 8 |
Sum of the numbers in the objective function | 255 |
Number of bits of the sum of numbers in the objective function | 8 |
Biggest number in a constraint | 32768 |
Number of bits of the biggest number in a constraint | 16 |
Biggest sum of numbers in a constraint | 130528 |
Number of bits of the biggest sum of numbers | 17 |
Number of products (including duplicates) | 64 |
Sum of products size (including duplicates) | 128 |
Number of different products | 64 |
Sum of products size | 128 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4113840 | OPT | 3 | 0.019996 | 0.020829 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4106240 | OPT | 3 | 0.182971 | 0.160438 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4106239 | OPT | 3 | 0.223965 | 1.14666 |
toysat 2016-05-02 (complete) | 4106238 | OPT | 3 | 2.06868 | 2.07021 |
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 x11 -x12 x13 x14 x15 x16 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 -x17 x18 -x19 -x20 -x21 -x22 -x23 -x24