Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j120/ normalized-j12015_3-unsat--soft-33-100-0.wbo |
MD5SUM | 0c296f9c06ec0d444dee5de3ba1f40ca |
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 | 5 |
Best CPU time to get the best result obtained on this benchmark | 612.787 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 21054 |
Total number of constraints | 66352 |
Number of soft constraints | 44341 |
Number of constraints which are clauses | 66008 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 344 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 93 |
Top cost | 2247790 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2247789 |
Biggest number in a constraint | 46 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 599 |
Number of bits of the biggest sum of numbers | 10 |
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) | 2698075 | OPTIMUM | 612.787 | 613.566 |
PB/CT 0.1 fixed (complete) | 2698816 | MSAT (TO) | 1800.08 | 1800.04 |
PB/CT 0.1 (complete) | 2695034 | Signal | 1.37579 | 1.37988 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691632 | Wrong UNSAT | 0.933857 | 0.8328 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690891 | Wrong UNSAT | 0.941856 | 0.722902 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694293 | Wrong UNSAT | 1.91771 | 1.04481 |
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: 5--too large--