Name | PB15eval/normalized-PB15eval/OPT-BIGINT-LIN/pbfvmc-formulae/ hw128/normalized-hw128-vm100p-opt.opb.negationfix.opb |
MD5SUM | 0aee14f9dddbd7be1efd1f634d515742 |
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 | |
Satisfiable | |
(Un)Satisfiability was proved | |
Best value of the objective function | |
Optimality of the best value was proved | |
Number of variables | |
Total number of constraints | |
Number of constraints which are clauses | |
Number of constraints which are cardinality constraints (but not clauses) | |
Number of constraints which are nor clauses,nor cardinality constraints | |
Minimum length of a constraint | |
Maximum length of a constraint | |
Number of terms in the objective function | |
Biggest coefficient in the objective function | |
Number of bits for the biggest coefficient in the objective function | |
Sum of the numbers in the objective function | |
Number of bits of the sum of numbers in the objective function | |
Biggest number in a constraint | |
Number of bits of the biggest number in a constraint | |
Biggest sum of numbers in a constraint | |
Number of bits of the biggest sum of numbers | |
Number of products (including duplicates) | |
Sum of products size (including duplicates) | |
Number of different products | |
Sum of products size |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4119779 | ? (TO) | 1800.08 | 1800.37 | |
toysat 2016-05-02 (complete) | 4119775 | ? (TO) | 1800.1 | 1800.45 | |
NaPS 1.02 (complete) | 4119777 | ? (TO) | 1800.11 | 1802.65 | |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4119776 | ? (TO) | 1800.13 | 903.568 | |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4119778 | ? (TO) | 1800.61 | 1792.45 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: