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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtvisgoodbakery0.aig.k20.gcnf
MD5SUMed3408a2aa0458c699e0aa1a64a2604c
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark242.695
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)3501688UNSAT 98.2231 98.3122
MoUsSaka 2011-03-26 (complete)3501491UNSAT 242.695 242.693
Haifa-HLMUC-A 2011-04-07 (complete)3502082UNSAT 250.109 250.166
Haifa-HLMUC 2011-04-07 (complete)3502279UNSAT 250.156 250.216
Haifa-HLMUC-A 2011-04-07 (complete)3501885UNSAT 327.144 327.151
MUSer 2011-02-10 (complete)3501097UNSAT 575.882 575.866
PicoGCNF 941 (complete)3501294UNSAT 1212.33 1212.27
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500900No Cert. 1800.24 1796

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