SAT 2011 Competition: group-oriented MUS track: solvers results per benchmarks

Result page for benchmark
gmus/belov/
pdtpmsgoodbakery.aig.k20.gcnf

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtpmsgoodbakery.aig.k20.gcnf
MD5SUMc32d0767929b800e01d25fbf5c79e7b4
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark349.505
Satisfiable
(Un)Satisfiability was proved
Number of variables38334
Number of clauses114829
Sum of the clauses size267933
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 276552
Number of clauses of size 338276
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups38276
Number of clauses in the kernel (group 0)1
Least number of clauses in a group (except group 0) 3
Greatest number of clauses in a group (except group 0) 3

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Haifa-HLMUC 2011-04-07 (complete)3502259UNSAT 349.505 349.569
Haifa-HLMUC-A 2011-04-07 (complete)3501865UNSAT 660.45 660.502
Haifa-HLMUC-A 2011-04-07 (complete)3502062UNSAT 985.32 985.306
MUSer 2011-02-10 (complete)3501076UNSAT 993.23 993.207
MoUsSaka 2011-03-26 (complete)3501471UNSAT 1797.32 1797.26
PicoGCNF 941 (complete)3501274No Cert. 1800.09 1800.08
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500879No Cert. 1800.14 1797.51
Haifa-HLMUC 2011-04-07 (complete)3501668Wrong Cert. 436.816 436.82

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:
--too large--