Name | /SOFT-BIGINT-LIN/PB10/oliveras/j120/ normalized-j1205_1-unsat--soft-0-100-0.wbo |
MD5SUM | 528ce3364f1db93944933a8c4cbb85cb |
Bench Category | SOFT-BIGINT-LIN (only soft 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 | 7.07392 |
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 | 70239 |
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 | 3558921 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 3558920 |
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) | 2698434 | OPTIMUM | 7.07392 | 5.10204 |
PB/CT 0.1 fixed (complete) | 2699175 | MSAT (TO) | 1800.12 | 1800.04 |
SCIPclp SCIP 1.2.1.3 with Clp 1.11.1 (Release Version) as LP solver (complete) | 2705383 | ? (TO) | 1800.09 | 1800.06 |
PB/CT 0.1 (complete) | 2695393 | Signal | 0.393939 | 0.394037 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691991 | Wrong Opt. | 7.29989 | 5.10756 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2691250 | Wrong Opt. | 8.79066 | 6.35208 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694652 | Wrong Opt. | 10.9833 | 7.35116 |
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--