SAT 2009 Competition: multithread track: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/bitverif/
minxorminand/minxorminand064.cnf
MD5SUM1394bf507e3ed448c81b5502d6550d78
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark136.35
Satisfiable
(Un)Satisfiability was proved
Number of variables40042
Number of clauses119357
Sum of the clauses size278497
Maximum clause length3
Minimum clause length1
Number of clauses of size 12
Number of clauses of size 279570
Number of clauses of size 339785
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)1778752UNSAT 136.35 35.5129
ManySAT 1.1 aimd 1/2009-03-20 (4 threads) (complete)1778749UNSAT 138.52 36.1416
ManySAT 1.1 aimd 0/2009-03-20 (4 threads) (complete)1778746UNSAT 153.61 39.8719
ttsth-5-0 2009-03-19 (4 threads) (complete)1778758? (MO) 1914.66 866.141
ttsth-5-0 2009-03-19 (16 threads) (complete)1778760? (MO) 3489.19 230.301
satake 2009-03-22 (16 threads) (complete)1778757? (MO) 5559.42 409.884
satake 2009-03-22 (4 threads) (complete)1778755? (TO) 1985.23 1000.07

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: