SAT 2009 Competition: multithread track: solvers results per benchmarks

Result page for benchmark
APPLICATIONS/bitverif/
minxorminand/minxorminand032.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/bitverif/
minxorminand/minxorminand032.cnf
MD5SUM49dda3faa6676166ee2ccb89f6cd8ca0
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark14.73
Satisfiable
(Un)Satisfiability was proved
Number of variables10794
Number of clauses31997
Sum of the clauses size74657
Maximum clause length3
Minimum clause length1
Number of clauses of size 12
Number of clauses of size 221330
Number of clauses of size 310665
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)1778764UNSAT 14.73 3.94754
ManySAT 1.1 aimd 0/2009-03-20 (4 threads) (complete)1778761UNSAT 15.53 4.17391
ManySAT 1.1 aimd 2/2009-03-20 (4 threads) (complete)1778767UNSAT 16.25 4.3452
satake 2009-03-22 (4 threads) (complete)1778770UNSAT 114.81 60.967
satake 2009-03-22 (16 threads) (complete)1778772UNSAT 576.188 97.9465
ttsth-5-0 2009-03-19 (4 threads) (complete)1778773? (MO) 1055.43 265.64
ttsth-5-0 2009-03-19 (16 threads) (complete)1778775? (MO) 3058.55 201.194

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: