Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9028_2-unsat--soft-33-100-0.wbo |
MD5SUM | 1096a1113afd2ce4c9ae102562d2176b |
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 | 3.73243 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 13832 |
Total number of constraints | 45398 |
Number of soft constraints | 30404 |
Number of constraints which are clauses | 45098 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 300 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 73 |
Top cost | 1539905 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1539904 |
Biggest number in a constraint | 68 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 479 |
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 CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691682 | OPTIMUM | 3.59145 | 1.92157 |
SAT4J PB Resolution 2.2.1 (complete) | 2698125 | OPTIMUM | 3.73243 | 4.29881 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690941 | OPTIMUM | 4.21436 | 2.24464 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694343 | OPTIMUM | 5.39018 | 3.12165 |
PB/CT 0.1 fixed (complete) | 2698866 | MSAT (TO) | 1800.08 | 1800.02 |
PB/CT 0.1 (complete) | 2695084 | Signal | 0.766882 | 0.771428 |
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--