Name | normalized-PB06/OPT-BIGINT/mps-v2-20-10/ftp.netlib.org/ lp/data/normalized-mps-v2-20-10-scagr7.opb |
MD5SUM | 69d6c62daf59435a58a3bb454faebc4a |
Bench Category | OPT-BIGINT (optimisation, big 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 | 2.19667 |
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 | 4200 |
Total number of constraints | 129 |
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 | 129 |
Minimum length of a constraint | 30 |
Maximum length of a constraint | 300 |
Number of terms in the objective function | 3990 |
Biggest coefficient in the objective function | 35540854374400 |
Number of bits for the biggest coefficient in the objective function | 46 |
Sum of the numbers in the objective function | 1307201212607598 |
Number of bits of the sum of numbers in the objective function | 51 |
Biggest number in a constraint | 35540854374400 |
Number of bits of the biggest number in a constraint | 46 |
Biggest sum of numbers in a constraint | 1307201212607598 |
Number of bits of the biggest sum of numbers | 51 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |
Solver Name | TraceID | Answer | obj | CPU time | Wall clock time |
---|---|---|---|---|---|
SAT4J Pseudo Resolution 2.1.1 (complete) | 1856279 | UNSAT | 2.19667 | 1.27884 | |
SAT4J Pseudo CP 2.1.1 (complete) | 1856278 | UNSAT | 2.28365 | 1.36824 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: