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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pj2010.aig.k25.gcnf
MD5SUMc47eecf0b402e36539f0f87ce1331bd1
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark99.4699
Satisfiable
(Un)Satisfiability was proved
Number of variables418467
Number of clauses1233244
Sum of the clauses size2877568
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 2822162
Number of clauses of size 3411081
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups411081
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)3501678UNSAT 75.7065 75.7749
MoUsSaka 2011-03-26 (complete)3501481UNSAT 99.4699 99.4705
Haifa-HLMUC-A 2011-04-07 (complete)3502072UNSAT 202.327 202.325
Haifa-HLMUC-A 2011-04-07 (complete)3501875UNSAT 207.792 207.807
Haifa-HLMUC 2011-04-07 (complete)3502269UNSAT 1072.59 1072.57
MUSer 2011-02-10 (complete)3501086? (exit code) 1199.09 1199.04
PicoGCNF 941 (complete)3501284No Cert. 1800.06 1800.01
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500889No Cert. 1800.15 1796.11

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