Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j90/ normalized-j9028_2-unsat--soft-66-100-0.wbo |
MD5SUM | c93ff145655ec29711075f2ee972c9ae |
Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 20 |
Best CPU time to get the best result obtained on this benchmark | 0.083986 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 13832 |
Total number of constraints | 45398 |
Number of soft constraints | 15436 |
Number of constraints which are clauses | 45098 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 300 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 73 |
Top cost | 781630 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 781629 |
Biggest number in a constraint | 68 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 479 |
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 |
---|---|---|---|---|
clasp 2.0-RC2 (complete) | 3448360 | OPTIMUM | 0.083986 | 0.0840851 |
wbo 1.6 (complete) | 3446756 | OPTIMUM | 0.120981 | 0.120695 |
Sat4j Resolution 2011-06-08 (complete) | 3492296 | OPTIMUM | 2.67959 | 1.27751 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447493 | OPTIMUM | 15.1037 | 15.1071 |
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: 20-x13824 -x13825 -x13826 -x13827 -x13828 -x13829 -x13830 -x13831 x13832