Name | normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/ manquinho/dbsg/normalized-dbsg_500_60_5_80.opb |
MD5SUM | d5640996c15a8815d620b5d6c220fea1 |
Bench Category | DEC-SMALLINT-NLC (no optimisation, small integers, non linear constraints) |
Best result obtained on this benchmark | |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | |
Has Objective Function | NO |
Satisfiable | |
(Un)Satisfiability was proved | |
Best value of the objective function | |
Optimality of the best value was proved | |
Number of variables | 1000 |
Total number of constraints | 1502 |
Number of constraints which are clauses | 500 |
Number of constraints which are cardinality constraints (but not clauses) | 1 |
Number of constraints which are nor clauses,nor cardinality constraints | 1001 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 1000 |
Number of terms in the objective function | 0 |
Biggest coefficient in the objective function | 0 |
Number of bits for the biggest coefficient in the objective function | 0 |
Sum of the numbers in the objective function | 0 |
Number of bits of the sum of numbers in the objective function | 0 |
Biggest number in a constraint | 80 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 1000 |
Number of bits of the biggest sum of numbers | 10 |
Number of products (including duplicates) | 75000 |
Sum of products size (including duplicates) | 150000 |
Number of different products | 37500 |
Sum of products size | 75000 |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4113784 | ? (TO) | 1800.01 | 1800.5 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4106881 | ? (TO) | 1800.02 | 899.057 |
toysat 2016-05-02 (complete) | 4106880 | ? (TO) | 1800.12 | 1800.52 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4106882 | ? (TO) | 1800.51 | 1790.45 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: