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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtvisgoodbakery2.aig.k25.gcnf
MD5SUM3752e4f5670213a8bb9d67d0b8cec264
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark621.008
Satisfiable
(Un)Satisfiability was proved
Number of variables135597
Number of clauses406570
Sum of the clauses size948662
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 2271046
Number of clauses of size 3135523
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups135523
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)3501626UNSAT 242.467 242.484
Haifa-HLMUC 2011-04-07 (complete)3502217UNSAT 621.008 621.564
Haifa-HLMUC-A 2011-04-07 (complete)3501823UNSAT 807.7 807.785
Haifa-HLMUC-A 2011-04-07 (complete)3502020UNSAT 1610.97 1610.97
MoUsSaka 2011-03-26 (complete)3501429UNSAT 1714.15 1714.2
MUSer 2011-02-10 (complete)3501033? (exit code) 1199.05 1199.02
PicoGCNF 941 (complete)3501232No Cert. 1800.05 1800.02
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500836No Cert. 1800.38 1795.99

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