Name | normalized-PB06/OPT-SMALLINT/submitted-PB05/manquinho/ primes-dimacs-cnf/normalized-ssa2670-130.opb |
MD5SUM | 805460c9bad8cc3db817372fa8e96e60 |
Bench Category | OPT-SMALLINT (optimisation, small integers) |
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.088985 |
Has Objective Function | YES |
Satisfiable | NO |
(Un)Satisfiability was proved | YES |
Best value of the objective function | |
Optimality of the best value was proved | |
Number of variables | 2718 |
Total number of constraints | 4680 |
Number of constraints which are clauses | 4680 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 5 |
Number of terms in the objective function | 2718 |
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 | 2718 |
Number of bits of the sum of numbers in the objective function | 12 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 2718 |
Number of bits of the biggest sum of numbers | 12 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |