Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-37s.smv--soft-66-100-0.wbo |
MD5SUM | 6960a3e1b4c37b3f708766f7f477a0ea |
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.432933 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 1190 |
Total number of constraints | 3183 |
Number of soft constraints | 1087 |
Number of constraints which are clauses | 3055 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 128 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Top cost | 55569 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 55568 |
Biggest number in a constraint | 43 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 136 |
Number of bits of the biggest sum of numbers | 8 |
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) | 4110038 | OPTIMUM | 0.432933 | 0.434238 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110036 | OPTIMUM | 1.01384 | 0.491509 |
NaPS 1.02 (complete) | 4110039 | OPTIMUM | 3.15852 | 3.15982 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110037 | OPTIMUM | 3.58445 | 2.47598 |
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: 1x1181 -x1182 -x1183 -x1184 x1185 x1186 -x1187 -x1188 -x1189 x1190