Name | /OPT-BIGINT-LIN/aries-da_nrp/ normalized-aries-da_network_100_3__3_91__256.opb |
MD5SUM | c277e86a21dcc18ae5570c72f9bfb707 |
Bench Category | OPT-BIGINT-LIN (optimisation, big integers, linear constraints) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 3035258 |
Best CPU time to get the best result obtained on this benchmark | 1800.68 |
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 | 76898 |
Total number of constraints | 400 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 302 |
Number of constraints which are nor clauses,nor cardinality constraints | 98 |
Minimum length of a constraint | 256 |
Maximum length of a constraint | 4353 |
Number of terms in the objective function | 76800 |
Biggest coefficient in the objective function | 94834 |
Number of bits for the biggest coefficient in the objective function | 17 |
Sum of the numbers in the objective function | 2771688192 |
Number of bits of the sum of numbers in the objective function | 32 |
Biggest number in a constraint | 94834 |
Number of bits of the biggest number in a constraint | 17 |
Biggest sum of numbers in a constraint | 2771688192 |
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 Resolution 2.1.1 (complete) | 1859699 | SAT (TO) | 3035258 | 1800.68 | 1798.29 |
SAT4J Pseudo CP 2.1.1 (complete) | 1859698 | ? (TO) | 1800.24 | 1776.55 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 3035258--too large--