Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j60/ normalized-j603_2-unsat--soft-66-100-0.wbo |
MD5SUM | a7745b03d5f34a8c8e093e23f8a69b95 |
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 | 31 |
Best CPU time to get the best result obtained on this benchmark | 0.048992 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 8418 |
Total number of constraints | 26241 |
Number of soft constraints | 8842 |
Number of constraints which are clauses | 25969 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 272 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 18 |
Top cost | 445005 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 445004 |
Biggest number in a constraint | 23 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 119 |
Number of bits of the biggest sum of numbers | 7 |
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) | 3448412 | OPTIMUM | 0.048992 | 0.0501431 |
wbo 1.6 (complete) | 3446809 | OPTIMUM | 0.063989 | 0.0660139 |
Sat4j Resolution 2011-06-08 (complete) | 3492349 | OPTIMUM | 1.9417 | 0.871678 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447546 | OPTIMUM | 47.5118 | 47.5141 |
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: 31-x8408 -x8409 -x8410 -x8411 -x8412 -x8413 -x8414 -x8415 -x8416 -x8417 x8418