Name | /OPT-BIGINT-LIN/heinz/ normalized-opm2-z12-s7.opb |
MD5SUM | f90862d191ee74c723e0b8b51b7e0fa9 |
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 | -39400 |
Best CPU time to get the best result obtained on this benchmark | 1800.25 |
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 | 10800 |
Total number of constraints | 319508 |
Number of constraints which are clauses | 319500 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 8 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 10800 |
Number of terms in the objective function | 10742 |
Biggest coefficient in the objective function | 574 |
Number of bits for the biggest coefficient in the objective function | 10 |
Sum of the numbers in the objective function | 1510061 |
Number of bits of the sum of numbers in the objective function | 21 |
Biggest number in a constraint | 3704832 |
Number of bits of the biggest number in a constraint | 22 |
Biggest sum of numbers in a constraint | 26061465 |
Number of bits of the biggest sum of numbers | 25 |
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 Resolution 2.3.0 (complete) | 3479351 | SAT (TO) | 1800.25 | 1798.81 |
Sat4j CuttingPlanes 2.3.0 (complete) | 3479350 | SAT (TO) | 1800.32 | 1793.92 |
Sat4j Res//CP 2.3.0 (complete) | 3479349 | SAT (TO) | 1800.42 | 902.615 |
MinisatID 2.5.2-gmp (fixed) (complete) | 3498204 | ? (TO) | 1800.08 | 1800.04 |
MinisatID 2.4.8-gmp [DEPRECATED] (complete) | 3479352 | ? (TO) | 1800.15 | 1800.16 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: -39400--too large--