Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-cache-ibm-q-unbounded.Icl2arity.ucl--soft-33-100-0.wbo |
MD5SUM | 0afe629a1fa58c97510ae9a594e5d328 |
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 | 1 |
Best CPU time to get the best result obtained on this benchmark | 53.3169 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 23837 |
Total number of constraints | 67568 |
Number of soft constraints | 45246 |
Number of constraints which are clauses | 64398 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 3170 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 13 |
Top cost | 2286779 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2286778 |
Biggest number in a constraint | 66 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 256 |
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) | 2698027 | OPTIMUM | 53.3169 | 54.5582 |
PB/CT 0.1 fixed (complete) | 2698768 | MSAT (TO) | 1800.07 | 1800.03 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691584 | MSAT (TO) | 1800.37 | 1889.87 |
PB/CT 0.1 (complete) | 2694986 | Signal | 0.439932 | 0.439353 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690843 | Wrong Opt. | 71.9111 | 68.7749 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694245 | Wrong Opt. | 740.638 | 720.293 |
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: 1--too large--