Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/ manquinho/mis/normalized-mis_10_4_2.opb |
MD5SUM | 409fc161256ebdd300d2786ef91cfdcf |
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.001999 |
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 | 10 |
Total number of constraints | 10 |
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 | 10 |
Minimum length of a constraint | 4 |
Maximum length of a constraint | 6 |
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 | 10 |
Number of bits of the biggest sum of numbers | 4 |
Number of products (including duplicates) | 48 |
Sum of products size (including duplicates) | 96 |
Number of different products | 24 |
Sum of products size | 48 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4113078 | OPT | -3 | 0.001999 | 0.00697789 |
toysat 2016-05-02 (complete) | 4080156 | OPT | -3 | 0.021996 | 0.0225889 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4085862 | OPT | -3 | 0.162975 | 0.151198 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4081782 | OPT | -3 | 0.173972 | 1.64356 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: -3-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