Name | normalized-PB06/OPT-BIGINT/submitted-PB06/roussel/factor/ normalized-factor-sizeN=340-sizeP=171-sizeQ=340-700380480.opb |
MD5SUM | 7b9a0d3bf1a9c200d7f28b922540147b |
Bench Category | OPT-BIGINT (optimisation, big integers) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 1 |
Best CPU time to get the best result obtained on this benchmark | 4.5863 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 1 |
Optimality of the best value was proved | YES |
Number of variables | 58651 |
Total number of constraints | 174421 |
Number of constraints which are clauses | 174420 |
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 | 58140 |
Number of terms in the objective function | 171 |
Biggest coefficient in the objective function | 1496577676626844588240573268701473812127674924007424 |
Number of bits for the biggest coefficient in the objective function | 171 |
Sum of the numbers in the objective function | 2993155353253689176481146537402947624255349848014847 |
Number of bits of the sum of numbers in the objective function | 171 |
Biggest number in a constraint | 1675975991242824637446753124775730765934920727574049172215445180465220503759193372100234287270862928461253982273310756356719235351493321243304206125760512 |
Number of bits of the biggest number in a constraint | 510 |
Biggest sum of numbers in a constraint | 6703903964971298549787012499102923063739682910296195038597131527667767167333656272927595621892946315600953569576375136127347577727820033305822846748291905 |
Number of bits of the biggest sum of numbers | 511 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 1--too large--