Name | /OPT-BIGINT-LIN/ heinz/normalized-t1722.opb |
MD5SUM | 5a4916943480b697e6c7cc05543abfc1 |
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 | 214699 |
Best CPU time to get the best result obtained on this benchmark | 1800.33 |
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 | 36630 |
Total number of constraints | 338 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 338 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 389 |
Maximum length of a constraint | 420 |
Number of terms in the objective function | 36630 |
Biggest coefficient in the objective function | 4032 |
Number of bits for the biggest coefficient in the objective function | 12 |
Sum of the numbers in the objective function | 85788512 |
Number of bits of the sum of numbers in the objective function | 27 |
Biggest number in a constraint | 4032 |
Number of bits of the biggest number in a constraint | 12 |
Biggest sum of numbers in a constraint | 85788512 |
Number of bits of the biggest sum of numbers | 27 |
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 | CPU time | Wall clock time |
---|---|---|---|---|
Sat4j CuttingPlanes 2.3.0 (complete) | 3479358 | SAT (TO) | 1800.33 | 1797.63 |
Sat4j Resolution 2.3.0 (complete) | 3479359 | SAT (TO) | 1800.33 | 1798.85 |
Sat4j Res//CP 2.3.0 (complete) | 3479357 | SAT (TO) | 1800.52 | 902.289 |
MinisatID 2.4.8-gmp [DEPRECATED] (complete) | 3479360 | ? (TO) | 1800.07 | 1802.03 |
MinisatID 2.5.2-gmp (fixed) (complete) | 3498211 | ? (TO) | 1800.09 | 1800.03 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 259584--too large--