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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtvisbakery1.aig.k20.gcnf
MD5SUM98f391ff900245a55ddb3f43fe3c0f0c
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark194.633
Satisfiable
(Un)Satisfiability was proved
Number of variables101544
Number of clauses304456
Sum of the clauses size710396
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 2202970
Number of clauses of size 3101485
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups101485
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)3501616UNSAT 82.4545 82.547
MoUsSaka 2011-03-26 (complete)3501419UNSAT 194.633 196.147
Haifa-HLMUC-A 2011-04-07 (complete)3501813UNSAT 213.768 213.806
Haifa-HLMUC-A 2011-04-07 (complete)3502010UNSAT 239.142 239.219
Haifa-HLMUC 2011-04-07 (complete)3502207UNSAT 254.253 255.628
MUSer 2011-02-10 (complete)3501023UNSAT 863.202 863.183
PicoGCNF 941 (complete)3501222UNSAT 1357.18 1357.55
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500826UNSAT 1788.38 1785.31

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