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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtvisbakery2.aig.k20.gcnf
MD5SUMaeae53d4efd778361ab7f6c719c5fabb
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark207.861
Satisfiable
(Un)Satisfiability was proved
Number of variables101617
Number of clauses304675
Sum of the clauses size710907
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 2203116
Number of clauses of size 3101558
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups101558
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)3501744UNSAT 79.3169 79.3664
Haifa-HLMUC 2011-04-07 (complete)3502335UNSAT 207.861 207.858
MoUsSaka 2011-03-26 (complete)3501547UNSAT 244.663 244.658
Haifa-HLMUC-A 2011-04-07 (complete)3501941UNSAT 258.793 258.869
Haifa-HLMUC-A 2011-04-07 (complete)3502138UNSAT 287.05 287.117
MUSer 2011-02-10 (complete)3501153UNSAT 741.534 741.516
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500956UNSAT 1304.31 1302.11
PicoGCNF 941 (complete)3501350UNSAT 1656.31 1656.32

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