Name | /SOFT-BIGINT-LIN/PB10/oliveras/j120/ normalized-j1205_1-unsat--soft-0-100-0.wbo |
MD5SUM | 528ce3364f1db93944933a8c4cbb85cb |
Bench Category | SOFT-BIGINT-LIN (only soft constraints, big integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 3 |
Best CPU time to get the best result obtained on this benchmark | 2.72458 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 22264 |
Total number of constraints | 70239 |
Number of soft constraints | 70239 |
Number of constraints which are clauses | 69875 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 364 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 34 |
Top cost | 3558921 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 3558920 |
Biggest number in a constraint | 28 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 210 |
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 2.3.6 Resolution PB16 (complete) | 4090832 | OPTIMUM | 2.72458 | 1.38478 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092218 | OPTIMUM | 5.11522 | 2.49734 |
toysat 2016-05-02 (complete) | 4093604 | OPTIMUM | 9.97048 | 9.97392 |
NaPS 1.02 (complete) | 4094990 | MSAT (MO) | 81.4176 | 81.4334 |
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: 3--too large--