Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-46s.smv--soft-33-100-0.wbo |
MD5SUM | c0de7a271d508347ff52629783e8132d |
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 | 1 |
Best CPU time to get the best result obtained on this benchmark | 0.641902 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 1612 |
Total number of constraints | 3653 |
Number of soft constraints | 2427 |
Number of constraints which are clauses | 3273 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 380 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 13 |
Top cost | 124130 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 124129 |
Biggest number in a constraint | 79 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 268 |
Number of bits of the biggest sum of numbers | 9 |
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) | 4093424 | OPTIMUM | 0.641902 | 0.645354 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090652 | OPTIMUM | 1.68474 | 0.734859 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092038 | OPTIMUM | 3.24251 | 2.96667 |
NaPS 1.02 (complete) | 4094810 | OPTIMUM | 19.457 | 19.4593 |
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: 1x1611 -x1612