SAT 2009 Competition: multithread track: solvers results per benchmarks

Result page for benchmark
APPLICATIONS/bitverif/countbitsarray/
countbitsarray02_32.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/bitverif/countbitsarray/
countbitsarray02_32.cnf
MD5SUMda0c445b72f13d929ab0690c3bfa81ed
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark601.74
Satisfiable
(Un)Satisfiability was proved
Number of variables4252
Number of clauses12563
Sum of the clauses size29311
Maximum clause length3
Minimum clause length1
Number of clauses of size 12
Number of clauses of size 28374
Number of clauses of size 34187
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 1/2009-03-20 (4 threads) (complete)1779094UNSAT 601.74 151.144
ManySAT 1.1 aimd 2/2009-03-20 (4 threads) (complete)1779097UNSAT 917.62 230.673
ManySAT 1.1 aimd 0/2009-03-20 (4 threads) (complete)1779091UNSAT 1619.56 410.998
ttsth-5-0 2009-03-19 (4 threads) (complete)1779103? (MO) 322.68 81.3438
ttsth-5-0 2009-03-19 (16 threads) (complete)1779105? (MO) 895.048 57.1998
satake 2009-03-22 (16 threads) (complete)1779102? (TO) 1018.23 1000.03
satake 2009-03-22 (4 threads) (complete)1779100? (TO) 1723.06 1000.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: