Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.unbounded.all.ucl--soft-66-100-0.wbo |
MD5SUM | 8a7b280af2f03093297f21c42e0139c3 |
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 | 1550.29 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 84836 |
Total number of constraints | 245062 |
Number of soft constraints | 83464 |
Number of constraints which are clauses | 233598 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 11464 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 15 |
Top cost | 4203368 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 4203367 |
Biggest number in a constraint | 129 |
Number of bits of the biggest number in a constraint | 8 |
Biggest sum of numbers in a constraint | 510 |
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 |
---|---|---|---|---|
SAT4J PB Resolution 2.2.1 (complete) | 2698045 | OPTIMUM | 1550.29 | 1538.3 |
PB/CT 0.1 fixed (complete) | 2698786 | MSAT (TO) | 1800.12 | 1800.08 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690861 | MSAT (TO) | 1800.31 | 1778.86 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694263 | MSAT (TO) | 1800.5 | 1492.98 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691602 | MSAT (TO) | 1800.54 | 1865.17 |
PB/CT 0.1 (complete) | 2695004 | Signal | 1.60176 | 1.60288 |
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--