Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-elf.rf7.ucl--soft-66-100-0.wbo |
MD5SUM | 0f5209330b13fd9909fb37660b8a3f5d |
Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 2 |
Best CPU time to get the best result obtained on this benchmark | 0.305952 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 1328 |
Total number of constraints | 3349 |
Number of soft constraints | 1145 |
Number of constraints which are clauses | 3165 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 184 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Top cost | 58120 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 58119 |
Biggest number in a constraint | 33 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 126 |
Number of bits of the biggest sum of numbers | 7 |
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 |
---|---|---|---|---|
toysat 2016-05-02 (complete) | 4110110 | OPTIMUM | 0.305952 | 0.309991 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110108 | OPTIMUM | 0.873866 | 0.44786 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110109 | OPTIMUM | 1.85172 | 1.89703 |
NaPS 1.02 (complete) | 4110111 | OPTIMUM | 3.3195 | 3.32125 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
cost of falsified constraints: 2x1321 x1322 -x1323 x1324 x1325 x1326 x1327 x1328