Name | normalized-PB06/OPT-BIGINT/submitted-PB06/roussel/factor/ normalized-factor-sizeN=60-sizeP=31-sizeQ=60-784051325-max.opb |
MD5SUM | 00fd5397600f602b7512f4fbf6ea5edc |
Bench Category | OPT-BIGINT (optimisation, big integers) |
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 | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | -15 |
Optimality of the best value was proved | NO |
Number of variables | 1951 |
Total number of constraints | 5581 |
Number of constraints which are clauses | 5580 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 1 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 1860 |
Number of terms in the objective function | 31 |
Biggest coefficient in the objective function | 1073741824 |
Number of bits for the biggest coefficient in the objective function | 31 |
Sum of the numbers in the objective function | 2147483647 |
Number of bits of the sum of numbers in the objective function | 31 |
Biggest number in a constraint | 618970019642690137449562112 |
Number of bits of the biggest number in a constraint | 90 |
Biggest sum of numbers in a constraint | 2475880078237913026827969150 |
Number of bits of the biggest sum of numbers | 91 |
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 CP 2.1.1 (complete) | 1856860 | ? (TO) | 1800.15 | 1790.51 | |
SAT4J Pseudo Resolution 2.1.1 (complete) | 1856861 | ? (TO) | 1800.41 | 1797.44 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: