Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/ factor-mod-B/factor-mod-size=5-P0=29-P1=23-B.opb |
MD5SUM | 05e48b36cc39be8381f82f346abe2761 |
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.006998 |
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 | 15 |
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 | 5 |
Maximum length of a constraint | 30 |
Number of terms in the objective function | 5 |
Biggest coefficient in the objective function | 16 |
Number of bits for the biggest coefficient in the objective function | 5 |
Sum of the numbers in the objective function | 31 |
Number of bits of the sum of numbers in the objective function | 5 |
Biggest number in a constraint | 512 |
Number of bits of the biggest number in a constraint | 10 |
Biggest sum of numbers in a constraint | 1980 |
Number of bits of the biggest sum of numbers | 11 |
Number of products (including duplicates) | 25 |
Sum of products size (including duplicates) | 50 |
Number of different products | 25 |
Sum of products size | 50 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4114623 | OPT | 3 | 0.006998 | 0.00705409 |
toysat 2016-05-02 (complete) | 4106046 | OPT | 3 | 0.031994 | 0.03282 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4106048 | OPT | 3 | 0.164974 | 0.141299 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4106047 | OPT | 3 | 0.173972 | 1.153 |
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 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 -x11 -x12 -x13 -x14 -x15