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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtviseisenberg0.aig.k20.gcnf
MD5SUMbbc2b24357d183daabd72a46b23531b2
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark152.581
Satisfiable
(Un)Satisfiability was proved
Number of variables39396
Number of clauses118021
Sum of the clauses size275381
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 278680
Number of clauses of size 339340
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups39340
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)3501677UNSAT 62.2475 62.3129
Haifa-HLMUC 2011-04-07 (complete)3502268UNSAT 152.581 152.579
MoUsSaka 2011-03-26 (complete)3501480UNSAT 330.296 330.294
PicoGCNF 941 (complete)3501283UNSAT 523.11 523.118
Haifa-HLMUC-A 2011-04-07 (complete)3502071UNSAT 581.52 581.539
MUSer 2011-02-10 (complete)3501085UNSAT 634.626 634.609
Haifa-HLMUC-A 2011-04-07 (complete)3501874UNSAT 675.152 675.203
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500888No Cert. 1800.25 1796.52

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