Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-cache.inv8.ucl--soft-66-100-0.wbo |
MD5SUM | 34826a5359f13c7b3705d5842f0dda66 |
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 | 41 |
Best CPU time to get the best result obtained on this benchmark | 0.535918 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 2355 |
Total number of constraints | 6744 |
Number of soft constraints | 2250 |
Number of constraints which are clauses | 6568 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 176 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 9 |
Top cost | 113822 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 113821 |
Biggest number in a constraint | 17 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 62 |
Number of bits of the biggest sum of numbers | 6 |
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) | 4110018 | OPTIMUM | 0.535918 | 0.535963 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110016 | OPTIMUM | 1.62375 | 0.696803 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110017 | OPTIMUM | 5.01324 | 3.12746 |
NaPS 1.02 (complete) | 4110019 | OPTIMUM | 12.4391 | 12.4421 |
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: 41-x2351 -x2352 -x2353 -x2354 x2355