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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtvisgoodbakery1.aig.k20.gcnf
MD5SUMddc25fcc7da0162a7a3805515ced5462
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark168.235
Satisfiable
(Un)Satisfiability was proved
Number of variables101544
Number of clauses304456
Sum of the clauses size710396
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 2202970
Number of clauses of size 3101485
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups101485
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)3501697UNSAT 117.411 117.512
MoUsSaka 2011-03-26 (complete)3501500UNSAT 168.235 168.231
Haifa-HLMUC-A 2011-04-07 (complete)3501894UNSAT 185.113 185.165
Haifa-HLMUC 2011-04-07 (complete)3502288UNSAT 239.687 239.725
Haifa-HLMUC-A 2011-04-07 (complete)3502091UNSAT 301.001 301.089
MUSer 2011-02-10 (complete)3501106UNSAT 536.415 536.417
PicoGCNF 941 (complete)3501303UNSAT 1586.6 1586.56
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500909UNSAT 1747.11 1743.74

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