SAT 2009 Competition: multithread track: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/bitverif/
minxorminand/minxorminand128.cnf
MD5SUMa551844fb6a7f35cf6025d0a525ca14e
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark1953.98
Satisfiable
(Un)Satisfiability was proved
Number of variables153834
Number of clauses459965
Sum of the clauses size1073249
Maximum clause length3
Minimum clause length1
Number of clauses of size 12
Number of clauses of size 2306642
Number of clauses of size 3153321
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)1778779UNSAT 1953.98 499.262
ManySAT 1.1 aimd 0/2009-03-20 (4 threads) (complete)1778776UNSAT 2002.32 511.185
ManySAT 1.1 aimd 2/2009-03-20 (4 threads) (complete)1778782UNSAT 2695.6 685.077
satake 2009-03-22 (16 threads) (complete)1778787? (MO) 3773.88 317.201
satake 2009-03-22 (4 threads) (complete)1778785? (TO) 1989.49 1000.08
ttsth-5-0 2009-03-19 (16 threads) (complete)1778790Signal 77.6049 77.6228
ttsth-5-0 2009-03-19 (4 threads) (complete)1778788Signal 104.49 104.573

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: