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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtviseisenberg1.aig.k20.gcnf
MD5SUMc93e9391b976c3ff7cd5dd562043945e
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark121.248
Satisfiable
(Un)Satisfiability was proved
Number of variables39395
Number of clauses118018
Sum of the clauses size275374
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 278678
Number of clauses of size 339339
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups39339
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)3501660UNSAT 64.5972 64.6627
Haifa-HLMUC 2011-04-07 (complete)3502251UNSAT 121.248 121.322
MoUsSaka 2011-03-26 (complete)3501463UNSAT 213.08 213.077
Haifa-HLMUC-A 2011-04-07 (complete)3501857UNSAT 407.932 408.016
PicoGCNF 941 (complete)3501266UNSAT 438.835 438.852
MUSer 2011-02-10 (complete)3501067UNSAT 439.249 439.239
Haifa-HLMUC-A 2011-04-07 (complete)3502054UNSAT 519.044 519.143
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500870No Cert. 1800.3 1795.94

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