Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j120/ normalized-j12023_3-unsat--soft-66-100-0.wbo |
MD5SUM | a804124947d8d61e7b46a8c92fb95b53 |
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 | 4.38533 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 23958 |
Total number of constraints | 79333 |
Number of soft constraints | 27000 |
Number of constraints which are clauses | 78941 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 392 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 38 |
Top cost | 1366623 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1366622 |
Biggest number in a constraint | 22 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 225 |
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) | 2698099 | OPTIMUM | 4.38533 | 5.20055 |
PB/CT 0.1 fixed (complete) | 2698840 | MSAT (TO) | 1800.04 | 1800.12 |
PB/CT 0.1 (complete) | 2695058 | Signal | 6.01808 | 6.01766 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690915 | Wrong UNSAT | 0.940856 | 0.566148 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691656 | Wrong UNSAT | 1.00385 | 0.543728 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694317 | Wrong UNSAT | 1.75373 | 0.777682 |
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--