Name | /OPT-BIGINT-LIN/aries-da_nrp/ normalized-aries-da_network_2000_5__647_1792__128.opb |
MD5SUM | 2104e5f01fbb9f409116374f650da887 |
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 | 1281998 |
Total number of constraints | 12000 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 10002 |
Number of constraints which are nor clauses,nor cardinality constraints | 1998 |
Minimum length of a constraint | 128 |
Maximum length of a constraint | 5633 |
Number of terms in the objective function | 1280000 |
Biggest coefficient in the objective function | 130539 |
Number of bits for the biggest coefficient in the objective function | 17 |
Sum of the numbers in the objective function | 44355197568 |
Number of bits of the sum of numbers in the objective function | 36 |
Biggest number in a constraint | 130539 |
Number of bits of the biggest number in a constraint | 17 |
Biggest sum of numbers in a constraint | 44355197568 |
Number of bits of the biggest sum of numbers | 36 |
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) | 1859650 | ? (TO) | 1800.31 | 1747 | |
SAT4J Pseudo Resolution 2.1.1 (complete) | 1859651 | ? (TO) | 1800.48 | 1765.93 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: