Name | /OPT-BIGINT-LIN/aries-da_nrp/ normalized-aries-da_network_1000_5__369_766__32.opb |
MD5SUM | 95367a36ca5654a079813431d40e8df1 |
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 | 29654920 |
Best CPU time to get the best result obtained on this benchmark | 1800.95 |
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 | 160998 |
Total number of constraints | 6000 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 5002 |
Number of constraints which are nor clauses,nor cardinality constraints | 998 |
Minimum length of a constraint | 32 |
Maximum length of a constraint | 1313 |
Number of terms in the objective function | 160000 |
Biggest coefficient in the objective function | 122979 |
Number of bits for the biggest coefficient in the objective function | 17 |
Sum of the numbers in the objective function | 5495354016 |
Number of bits of the sum of numbers in the objective function | 33 |
Biggest number in a constraint | 122979 |
Number of bits of the biggest number in a constraint | 17 |
Biggest sum of numbers in a constraint | 5495354016 |
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 Resolution 2.1.1 (complete) | 1859637 | SAT (TO) | 29654920 | 1800.95 | 1793.47 |
SAT4J Pseudo CP 2.1.1 (complete) | 1859636 | SAT (TO) | 29685721 | 1801.15 | 1771.16 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 29654920--too large--