Name | /PARTIAL-SMALLINT-LIN/PB06/web/ uclid_pb_benchmarks/normalized-blast-floppy1-7.ucl--soft-66-100-0.wbo |
MD5SUM | fc4fc608292ff0814d25e97efc86eb19 |
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 | 4 |
Best CPU time to get the best result obtained on this benchmark | 0.946855 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 2913 |
Total number of constraints | 3105 |
Number of soft constraints | 1046 |
Number of constraints which are clauses | 2259 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 846 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 25 |
Top cost | 52307 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 52306 |
Biggest number in a constraint | 6518 |
Number of bits of the biggest number in a constraint | 13 |
Biggest sum of numbers in a constraint | 18803 |
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) | 4093431 | OPTIMUM | 0.946855 | 0.946333 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090659 | OPTIMUM | 1.20282 | 0.557834 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092045 | OPTIMUM | 1.9637 | 1.50728 |
NaPS 1.02 (complete) | 4094817 | OPTIMUM | 91.0312 | 91.046 |
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: 4-x2911 x2912 x2913