Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.rf10.ucl--soft-33-100-0.wbo |
MD5SUM | 6b9e0e7b8c2487ebb19e3d24e4eb9574 |
Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big 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 | 397.321 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 18069 |
Total number of constraints | 52475 |
Number of soft constraints | 35092 |
Number of constraints which are clauses | 51555 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 920 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Top cost | 1770259 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1770258 |
Biggest number in a constraint | 39 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 132 |
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 |
---|---|---|---|---|
Sat4j Resolution 2011-06-08 (complete) | 3492025 | OPTIMUM | 397.321 | 396.284 |
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: 1--too large--