SAT 2009 Competition: multithread track: solvers results per benchmarks

Result page for benchmark
APPLICATIONS/bitverif/
minor/minor032.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/bitverif/
minor/minor032.cnf
MD5SUM93c9f18c75548b864ec69c2789cae658
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark1.07
Satisfiable
(Un)Satisfiability was proved
Number of variables4210
Number of clauses12053
Sum of the clauses size28121
Maximum clause length3
Minimum clause length1
Number of clauses of size 12
Number of clauses of size 28034
Number of clauses of size 34017
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
ManySAT 1.1 aimd 2/2009-03-20 (4 threads) (complete)1778737UNSAT 1.07 0.392164
ManySAT 1.1 aimd 1/2009-03-20 (4 threads) (complete)1778734UNSAT 1.29 0.448231
ManySAT 1.1 aimd 0/2009-03-20 (4 threads) (complete)1778731UNSAT 1.39 0.479068
satake 2009-03-22 (4 threads) (complete)1778740UNSAT 6.28 3.46878
satake 2009-03-22 (16 threads) (complete)1778742UNSAT 43.4307 36.1259
ttsth-5-0 2009-03-19 (4 threads) (complete)1778743? (MO) 336.44 84.7383
ttsth-5-0 2009-03-19 (16 threads) (complete)1778745? (MO) 696.343 44.7933

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: