Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j903_10-unsat--soft-33-100-0.wbo |
MD5SUM | 363e34ae88e6852946e02bd75c4c07f9 |
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 | 5 |
Best CPU time to get the best result obtained on this benchmark | 3.52246 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 11830 |
Total number of constraints | 36862 |
Number of soft constraints | 24617 |
Number of constraints which are clauses | 36606 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 256 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 29 |
Top cost | 1242431 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1242430 |
Biggest number in a constraint | 36 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 203 |
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) | 2698124 | OPTIMUM | 3.52246 | 2.17919 |
PB/CT 0.1 fixed (complete) | 2698865 | MSAT (TO) | 1800.05 | 1800.02 |
PB/CT 0.1 (complete) | 2695083 | Signal | 5.18421 | 5.19254 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691681 | Wrong Opt. | 3.14652 | 1.66527 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690940 | Wrong Opt. | 3.50447 | 1.85619 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694342 | Wrong Opt. | 4.88426 | 2.72853 |
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: 5--too large--