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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pj2008.aig.k20.gcnf
MD5SUM6c6e999194fd3d508ba12d16ef31aec0
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark145.714
Satisfiable
(Un)Satisfiability was proved
Number of variables314734
Number of clauses924250
Sum of the clauses size2156582
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 2616166
Number of clauses of size 3308083
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups308083
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)3501644UNSAT 36.2235 36.2255
MoUsSaka 2011-03-26 (complete)3501447UNSAT 145.714 145.713
Haifa-HLMUC-A 2011-04-07 (complete)3501841UNSAT 311.989 312.047
Haifa-HLMUC-A 2011-04-07 (complete)3502038UNSAT 336.788 336.869
Haifa-HLMUC 2011-04-07 (complete)3502235UNSAT 881.057 881.151
MUSer 2011-02-10 (complete)3501051? (exit code) 1199.07 1199.03
PicoGCNF 941 (complete)3501250No Cert. 1800.05 1800.01
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500854No Cert. 1800.13 1794.91

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