SAT 2009 Competition: multithread track: solvers results per benchmarks

Result page for benchmark
APPLICATIONS/bitverif/
minandmaxor/minandmaxor032.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/bitverif/
minandmaxor/minandmaxor032.cnf
MD5SUM25c7914ccc82f6f574febbd03924feed
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark19
Satisfiable
(Un)Satisfiability was proved
Number of variables16239
Number of clauses48332
Sum of the clauses size112772
Maximum clause length3
Minimum clause length1
Number of clauses of size 12
Number of clauses of size 232220
Number of clauses of size 316110
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)1778812UNSAT 19 5.12288
ManySAT 1.1 aimd 0/2009-03-20 (4 threads) (complete)1778806UNSAT 19.03 5.09918
ManySAT 1.1 aimd 1/2009-03-20 (4 threads) (complete)1778809UNSAT 20.12 5.42683
satake 2009-03-22 (4 threads) (complete)1778815UNSAT 144.79 48.339
satake 2009-03-22 (16 threads) (complete)1778817UNSAT 336.029 96.2249
ttsth-5-0 2009-03-19 (4 threads) (complete)1778818? (MO) 509.03 238.843
ttsth-5-0 2009-03-19 (16 threads) (complete)1778820? (MO) 814.255 53.7958

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: