SAT 2011 Competition: plain MUS track: solvers results per benchmarks

Result page for benchmark
application/leberre/
2dimensionalstrippacking/E13X15.cnf

Jump to solvers results

General information on the benchmark

Nameapplication/leberre/
2dimensionalstrippacking/E13X15.cnf
MD5SUM3addcdfff8167975b7c4d4c9c98c715b
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.034994
Satisfiable
(Un)Satisfiability was proved
Number of variables4740
Number of clauses40169
Sum of the clauses size186199
Maximum clause length45
Minimum clause length1
Number of clauses of size 121
Number of clauses of size 212176
Number of clauses of size 39082
Number of clauses of size 42970
Number of clauses of size 53915
Number of clauses of size over 512005

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MoUsSaka 2011-03-26 (complete)3495762UNSAT 0.034994 0.035406
Haifa-MUC 2011-04-07 (complete)3494262UNSAT 0.038993 0.040334
Haifa-MUC-A 2011-04-07 (complete)3493962UNSAT 0.084986 0.0866921
Haifa-MUC 2011-04-07 (complete)3494562UNSAT 0.086986 0.087263
MUSer 2011-02-10 (complete)3481145UNSAT 0.117981 0.135541
MiniUnsat2 2011-02-22 (complete)3483252UNSAT 0.150976 0.152549
PicoMUS 941 (complete)3483552UNSAT 0.367944 0.381343
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3482952UNSAT 2.07568 1.35021
OptimuS p100_source (complete)3495162UNSAT 5.37018 5.37059
OptimuS a100_source (complete)3494862UNSAT 5.47517 5.47656
OptimuS x100_source (complete)3495462UNSAT 92.334 92.3314

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found:
4338 4334 4333 4332 4319 4318 4317 4123 3780 3720 3477 3022 3012 3010 3001 2999 2998 2976 2974 2973 2972  0