Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j120/ normalized-j1205_1-unsat--soft-33-100-0.wbo |
MD5SUM | d8fc8cb56dd6881cea17f17ced8f18c9 |
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 | 3 |
Best CPU time to get the best result obtained on this benchmark | 4.93825 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 22264 |
Total number of constraints | 70239 |
Number of soft constraints | 47222 |
Number of constraints which are clauses | 69875 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 364 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 34 |
Top cost | 2382027 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2382026 |
Biggest number in a constraint | 28 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 210 |
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) | 2698069 | OPTIMUM | 4.93825 | 3.17763 |
PB/CT 0.1 fixed (complete) | 2698810 | MSAT (TO) | 1800.06 | 1800.03 |
PB/CT 0.1 (complete) | 2695028 | Signal | 1.3338 | 1.33477 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691626 | Wrong Opt. | 4.91025 | 3.23966 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690885 | Wrong Opt. | 5.8761 | 3.85268 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694287 | Wrong Opt. | 7.93979 | 5.08108 |
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: 3--too large--