Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j120/ normalized-j12013_1-unsat--soft-33-100-0.wbo |
MD5SUM | af27a3363dc9db8608eaadebe8e447c1 |
Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
Best result obtained on this benchmark | MSAT |
Best cost obtained on this benchmark | 4323 |
Best CPU time to get the best result obtained on this benchmark | 1800.38 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 29282 |
Total number of constraints | 92908 |
Number of soft constraints | 62298 |
Number of constraints which are clauses | 92428 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 480 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 93 |
Top cost | 3133829 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 3133828 |
Biggest number in a constraint | 32 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 554 |
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 |
---|---|---|---|---|
PB/CT 0.1 fixed (complete) | 2698837 | MSAT (TO) | 1800.09 | 1800.05 |
SAT4J PB Resolution 2.2.1 (complete) | 2698096 | MSAT (TO) | 1800.38 | 1799.84 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690912 | ? (TO) | 1800.19 | 1791.69 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691653 | ? (TO) | 1800.2 | 1735.94 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694314 | ? (TO) | 1800.5 | 888.537 |
PB/CT 0.1 (complete) | 2695055 | Signal | 0.841871 | 0.841225 |
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: 78904--too large--