Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.tag14.ucl--soft-66-100-0.wbo |
MD5SUM | e03e95feed68526713fa955672f1692a |
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 | 490.625 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 40605 |
Total number of constraints | 118930 |
Number of soft constraints | 40557 |
Number of constraints which are clauses | 117190 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 1740 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 13 |
Top cost | 2051228 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2051227 |
Biggest number in a constraint | 65 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 254 |
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 PB Resolution 2.2.1 (complete) | 2698010 | OPTIMUM | 490.625 | 490.723 |
PB/CT 0.1 fixed (complete) | 2698751 | MSAT (TO) | 1800.09 | 1800.04 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691567 | MSAT (TO) | 1800.31 | 1772.52 |
PB/CT 0.1 (complete) | 2694969 | Signal | 1.77673 | 1.80126 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690826 | Wrong Opt. | 123.448 | 120.899 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694228 | Wrong Opt. | 479.782 | 374.96 |
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--