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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pdtvisgoodbakery0.aig.k25.gcnf
MD5SUM7a2a85b640e423e2bf1308151f5248f8
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark637.637
Satisfiable
(Un)Satisfiability was proved
Number of variables136333
Number of clauses408778
Sum of the clauses size953814
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 2272518
Number of clauses of size 3136259
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups136259
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)3501661UNSAT 269.007 269.002
Haifa-HLMUC 2011-04-07 (complete)3502252UNSAT 637.637 637.764
Haifa-HLMUC-A 2011-04-07 (complete)3502055UNSAT 1111.99 1111.97
Haifa-HLMUC-A 2011-04-07 (complete)3501858UNSAT 1136.22 1136.3
MoUsSaka 2011-03-26 (complete)3501464UNSAT 1476.47 1476.43
MUSer 2011-02-10 (complete)3501069? (exit code) 1199.05 1199.03
PicoGCNF 941 (complete)3501267No Cert. 1800.14 1800.14
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500872No Cert. 1800.28 1796.04

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