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

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

Jump to solvers results

General information on the benchmark

Namegmus/belov/
pj2007.aig.k25.gcnf
MD5SUMaa03abda1d022f8b562043b661c96dc2
Bench CategoryGMUS (GMUS)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark238.419
Satisfiable
(Un)Satisfiability was proved
Number of variables390878
Number of clauses1149565
Sum of the clauses size2682317
Maximum clause length3
Minimum clause length1
Number of clauses of size 11
Number of clauses of size 2766376
Number of clauses of size 3383188
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50
Number of groups383188
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)3501738UNSAT 100.174 100.172
MoUsSaka 2011-03-26 (complete)3501541UNSAT 238.419 238.419
Haifa-HLMUC-A 2011-04-07 (complete)3502132UNSAT 342.734 342.779
Haifa-HLMUC-A 2011-04-07 (complete)3501935UNSAT 356.674 356.775
Haifa-HLMUC 2011-04-07 (complete)3502329UNSAT 734.636 734.62
MUSer 2011-02-10 (complete)3501147? (exit code) 1199.07 1199.04
PicoGCNF 941 (complete)3501344No Cert. 1800.09 1800.11
SAT4J MUS 2.3.0-SNAPSHOT 2011-02-06 (complete)3500950No Cert. 1800.27 1795.96

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