Name | /SOFT-BIGINT-LIN/PB10/oliveras/j120/ normalized-j12015_3-unsat--soft-0-100-0.wbo |
MD5SUM | 038b251452359c1f04349e7ac28f0fb8 |
Bench Category | SOFT-BIGINT-LIN (only soft constraints, big integers, linear constraints) |
Best result obtained on this benchmark | MSAT |
Best cost obtained on this benchmark | 1701 |
Best CPU time to get the best result obtained on this benchmark | 1800.24 |
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 | 66352 |
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 | 3337053 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 3337052 |
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.0 2010-05-26 (complete) | 2691253 | OPTIMUM | 80 | 76.9037 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694655 | OPTIMUM | 132.921 | 121.285 |
PB/CT 0.1 fixed (complete) | 2699178 | MSAT (TO) | 1800.11 | 1800.07 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691994 | MSAT (TO) | 1800.21 | 1785.69 |
SAT4J PB Resolution 2.2.1 (complete) | 2698437 | MSAT (TO) | 1800.24 | 1796.4 |
SCIPclp SCIP 1.2.1.3 with Clp 1.11.1 (Release Version) as LP solver (complete) | 2705386 | ? (TO) | 1800.11 | 1800.05 |
PB/CT 0.1 (complete) | 2695396 | Signal | 0.401938 | 0.402736 |
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--