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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtvisbakery0.aig.k20.gcnf
MD5SUMdcd948030e4f4983632058895f819e87
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark213.691
Satisfiable
(Un)Satisfiability was proved
Number of variables102168
Number of clauses306328
Sum of the clauses size714764
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 2204218
Number of clauses of size 3102109
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups102109
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)3501745UNSAT 102.938 102.938
MoUsSaka 2011-03-26 (complete)3501548UNSAT 213.691 213.696
Haifa-HLMUC-A 2011-04-07 (complete)3502139UNSAT 222.878 222.927
Haifa-HLMUC 2011-04-07 (complete)3502336UNSAT 244.144 244.22
Haifa-HLMUC-A 2011-04-07 (complete)3501942UNSAT 259.576 259.57
MUSer 2011-02-10 (complete)3501154UNSAT 687.649 687.632
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500957UNSAT 1259.52 1257.67
PicoGCNF 941 (complete)3501351UNSAT 1527.63 1527.61

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