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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtvisgoodbakery2.aig.k20.gcnf
MD5SUM690cdfb6aa30a69fa5a2db57dbccb43f
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark222.061
Satisfiable
(Un)Satisfiability was proved
Number of variables101617
Number of clauses304675
Sum of the clauses size710907
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 2203116
Number of clauses of size 3101558
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups101558
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)3501752UNSAT 68.1156 68.1658
MoUsSaka 2011-03-26 (complete)3501555UNSAT 222.061 222.068
Haifa-HLMUC-A 2011-04-07 (complete)3501949UNSAT 241.544 241.54
Haifa-HLMUC-A 2011-04-07 (complete)3502146UNSAT 259.173 259.211
Haifa-HLMUC 2011-04-07 (complete)3502343UNSAT 283.673 283.724
MUSer 2011-02-10 (complete)3501161UNSAT 690.126 690.108
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500964UNSAT 1167.71 1165.04
PicoGCNF 941 (complete)3501358UNSAT 1747.26 1747.2

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--