Name | /OPT-BIGINT-LIN/aries-da_nrp/ normalized-aries-da_network_20_2__17_12__256.opb |
MD5SUM | a048c41e885d13c7000ff4a85d8352bd |
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 | 46877 |
Best CPU time to get the best result obtained on this benchmark | 4.67229 |
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 | 10258 |
Total number of constraints | 60 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 42 |
Number of constraints which are nor clauses,nor cardinality constraints | 18 |
Minimum length of a constraint | 256 |
Maximum length of a constraint | 2049 |
Number of terms in the objective function | 10240 |
Biggest coefficient in the objective function | 94409 |
Number of bits for the biggest coefficient in the objective function | 17 |
Sum of the numbers in the objective function | 446607872 |
Number of bits of the sum of numbers in the objective function | 29 |
Biggest number in a constraint | 94409 |
Number of bits of the biggest number in a constraint | 17 |
Biggest sum of numbers in a constraint | 446607872 |
Number of bits of the biggest sum of numbers | 29 |
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) | 1859678 | OPT | 46877 | 4.67229 | 2.82782 |
SAT4J Pseudo Resolution 2.1.1 (complete) | 1859679 | SAT (TO) | 46877 | 1800.68 | 1797.95 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 46877--too large--