Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j907_8-unsat--soft-33-100-0.wbo |
MD5SUM | 4e95d2f358a1d03e64dd8ae41095cef7 |
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 | 2 |
Best CPU time to get the best result obtained on this benchmark | 3.16152 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 10920 |
Total number of constraints | 34033 |
Number of soft constraints | 22812 |
Number of constraints which are clauses | 33797 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 236 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 50 |
Top cost | 1153249 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1153248 |
Biggest number in a constraint | 60 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 345 |
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) | 2698112 | OPTIMUM | 3.16152 | 2.07771 |
PB/CT 0.1 fixed (complete) | 2698853 | MSAT (TO) | 1800.05 | 1800.02 |
PB/CT 0.1 (complete) | 2695071 | Signal | 0.32695 | 0.327283 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690928 | Wrong UNSAT | 0.825873 | 0.462217 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691669 | Wrong UNSAT | 0.856869 | 0.463768 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694330 | Wrong UNSAT | 1.26681 | 0.578452 |
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: 2--too large--