Name | /OPT-BIGINT-LIN/aries-da_nrp/ normalized-aries-da_network_50_2__8_45__1024.opb |
MD5SUM | df0687fd8341299b755e35d2a87794ea |
Bench Category | OPT-BIGINT-LIN (optimisation, big integers, linear constraints) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 45008 |
Best CPU time to get the best result obtained on this benchmark | 38.3732 |
Has Objective Function | YES |
Satisfiable | |
(Un)Satisfiability was proved | |
Best value of the objective function | |
Optimality of the best value was proved | |
Number of variables | 102448 |
Total number of constraints | 150 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 102 |
Number of constraints which are nor clauses,nor cardinality constraints | 48 |
Minimum length of a constraint | 1024 |
Maximum length of a constraint | 9217 |
Number of terms in the objective function | 102400 |
Biggest coefficient in the objective function | 126454 |
Number of bits for the biggest coefficient in the objective function | 17 |
Sum of the numbers in the objective function | 3437091840 |
Number of bits of the sum of numbers in the objective function | 32 |
Biggest number in a constraint | 126454 |
Number of bits of the biggest number in a constraint | 17 |
Biggest sum of numbers in a constraint | 3437091840 |
Number of bits of the biggest sum of numbers | 32 |
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) | 1859674 | OPT | 45008 | 38.3732 | 34.8451 |
SAT4J Pseudo Resolution 2.1.1 (complete) | 1859675 | ? (TO) | 1800.25 | 1797.09 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 45008--too large--