Name | normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/ manquinho/dbsg/normalized-dbsg_100_25_4_15.opb |
MD5SUM | c41d0ae6b2deb2ba6caac7b74c416b6f |
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 | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | |
Optimality of the best value was proved | NO |
Number of variables | 200 |
Total number of constraints | 302 |
Number of constraints which are clauses | 100 |
Number of constraints which are cardinality constraints (but not clauses) | 1 |
Number of constraints which are nor clauses,nor cardinality constraints | 201 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 200 |
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 | 15 |
Number of bits of the biggest number in a constraint | 4 |
Biggest sum of numbers in a constraint | 200 |
Number of bits of the biggest sum of numbers | 8 |
Number of products (including duplicates) | 6140 |
Sum of products size (including duplicates) | 12280 |
Number of different products | 3070 |
Sum of products size | 6140 |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4114734 | ? (TO) | 1800.02 | 1800.3 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4107040 | ? (TO) | 1800.04 | 896.901 |
toysat 2016-05-02 (complete) | 4107039 | ? (TO) | 1800.07 | 1800.61 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4107041 | ? (TO) | 1800.72 | 1795.04 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: