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

Result page for benchmark
gmus/belov/
pdtswvrod6x8p2.aig.k25.gcnf

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtswvrod6x8p2.aig.k25.gcnf
MD5SUMc48f17c117ec03bd8edf00d6f3e8c9c1
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark478.608
Satisfiable
(Un)Satisfiability was proved
Number of variables78849
Number of clauses235924
Sum of the clauses size550488
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 2157282
Number of clauses of size 378641
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups78641
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)3501704UNSAT 292.583 292.671
MoUsSaka 2011-03-26 (complete)3501507UNSAT 478.608 478.597
Haifa-HLMUC 2011-04-07 (complete)3502295UNSAT 560.63 560.732
Haifa-HLMUC-A 2011-04-07 (complete)3501901UNSAT 738.109 738.154
MUSer 2011-02-10 (complete)3501113UNSAT 1093.28 1093.26
Haifa-HLMUC-A 2011-04-07 (complete)3502098UNSAT 1100.18 1100.23
PicoGCNF 941 (complete)3501310UNSAT 1381.09 1381.06
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500916No Cert. 1800.35 1796.94

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