SAT 2009 Competition: multithread track: solvers results per benchmarks

Result page for benchmark
schup-l2s-bc56s-1-k391.cnf

Jump to solvers results

General information on the benchmark

Nameschup-l2s-bc56s-1-k391.cnf
MD5SUM1f1dd0782ec95ee5e6d7a06f92fc0f12
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark1223.24
Satisfiable
(Un)Satisfiability was proved
Number of variables561371
Number of clauses1778987
Sum of the clauses size4570195
Maximum clause length392
Minimum clause length1
Number of clauses of size 1142
Number of clauses of size 2843213
Number of clauses of size 3908640
Number of clauses of size 416428
Number of clauses of size 56651
Number of clauses of size over 53913

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
ManySAT 1.1 aimd 0/2009-03-20 (4 threads) (complete)1776736UNSAT 1223.24 317.529
ManySAT 1.1 aimd 1/2009-03-20 (4 threads) (complete)1776739UNSAT 1645.94 560.098
ManySAT 1.1 aimd 2/2009-03-20 (4 threads) (complete)1776742UNSAT 1876.42 481.189
satake 2009-03-22 (16 threads) (complete)1776747? (MO) 79.1089 16.3722
ttsth-5-0 2009-03-19 (4 threads) (complete)1776748? (TO) 998.86 1000.03
ttsth-5-0 2009-03-19 (16 threads) (complete)1776750? (TO) 1000.03 1000.05
satake 2009-03-22 (4 threads) (complete)1776745? (TO) 3001.24 1000.06

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: