Name | normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/ manquinho/dbsg/normalized-dbsg_10_4_4_8.opb |
MD5SUM | 3d79ba0ee0b91a70716408d98d6e11cd |
Bench Category | DEC-SMALLINT-NLC (no optimisation, small integers, non linear constraints) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 0.006998 |
Has Objective Function | NO |
Satisfiable | NO |
(Un)Satisfiability was proved | YES |
Best value of the objective function | |
Optimality of the best value was proved | |
Number of variables | 20 |
Total number of constraints | 32 |
Number of constraints which are clauses | 10 |
Number of constraints which are cardinality constraints (but not clauses) | 1 |
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 | 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 | 8 |
Number of bits of the biggest number in a constraint | 4 |
Biggest sum of numbers in a constraint | 20 |
Number of bits of the biggest sum of numbers | 5 |
Number of products (including duplicates) | 92 |
Sum of products size (including duplicates) | 184 |
Number of different products | 46 |
Sum of products size | 92 |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4111885 | UNSAT | 0.006998 | 0.00719696 |
toysat 2016-05-02 (complete) | 4078963 | UNSAT | 0.015997 | 0.0198621 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4084669 | UNSAT | 0.171972 | 0.144669 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4080589 | UNSAT | 0.173972 | 0.643682 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: