| Name | /OPT-BIGINT-LIN/aries-da_nrp/ normalized-aries-da_network_500_3__212_366__128.opb |
| MD5SUM | 532f9d522f176ac928dfe97ba6769de3 |
| Bench Category | OPT-BIGINT-LIN (optimisation, big integers, linear constraints) |
| 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 | |
| (Un)Satisfiability was proved | |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 192498 |
| Total number of constraints | 2000 |
| Number of constraints which are clauses | 0 |
| Number of constraints which are cardinality constraints (but not clauses) | 1502 |
| Number of constraints which are nor clauses,nor cardinality constraints | 498 |
| Minimum length of a constraint | 128 |
| Maximum length of a constraint | 2689 |
| Number of terms in the objective function | 192000 |
| Biggest coefficient in the objective function | 114804 |
| Number of bits for the biggest coefficient in the objective function | 17 |
| Sum of the numbers in the objective function | 6567727872 |
| Number of bits of the sum of numbers in the objective function | 33 |
| Biggest number in a constraint | 114804 |
| Number of bits of the biggest number in a constraint | 17 |
| Biggest sum of numbers in a constraint | 6567727872 |
| Number of bits of the biggest sum of numbers | 33 |
| 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) | 1859634 | ? (TO) | 1800.24 | 1756.75 | |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1859635 | ? (TO) | 1800.36 | 1794.65 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: