Name | /PARTIAL-SMALLINT-LIN/PB06/web/ uclid_pb_benchmarks/normalized-blast-floppy1-8.ucl--soft-33-100-0.wbo |
MD5SUM | 79b867d4294d19cc249114a715561a23 |
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 | 3 |
Best CPU time to get the best result obtained on this benchmark | 1.46478 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 3618 |
Total number of constraints | 3931 |
Number of soft constraints | 2594 |
Number of constraints which are clauses | 2865 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 1066 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 25 |
Top cost | 130293 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 130292 |
Biggest number in a constraint | 7394 |
Number of bits of the biggest number in a constraint | 13 |
Biggest sum of numbers in a constraint | 19679 |
Number of bits of the biggest sum of numbers | 15 |
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) | 4093432 | OPTIMUM | 1.46478 | 1.4658 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090660 | OPTIMUM | 2.83357 | 1.54996 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092046 | OPTIMUM | 5.61315 | 5.64902 |
NaPS 1.02 (complete) | 4094818 | OPTIMUM | 132.813 | 132.838 |
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: 3-x3611 -x3612 x3613 -x3614 x3615 x3616 x3617 x3618