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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtvisns2p0.aig.k20.gcnf
MD5SUM3870b6e38041d9f02e7abd04a4a0903e
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark203.897
Satisfiable
(Un)Satisfiability was proved
Number of variables41808
Number of clauses124537
Sum of the clauses size290585
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 283024
Number of clauses of size 341512
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups41512
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)3501635UNSAT 55.4116 55.5133
Haifa-HLMUC 2011-04-07 (complete)3502226UNSAT 203.897 203.979
Haifa-HLMUC-A 2011-04-07 (complete)3502029UNSAT 361.927 361.992
MoUsSaka 2011-03-26 (complete)3501438UNSAT 397.842 397.837
MUSer 2011-02-10 (complete)3501042UNSAT 564.48 564.464
PicoGCNF 941 (complete)3501241UNSAT 596.029 596.025
Haifa-HLMUC-A 2011-04-07 (complete)3501832UNSAT 1448.05 1448.09
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500845No Cert. 1800.31 1797.14

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