SAT 2009 Competition: multithread track: solvers results per benchmarks

Result page for benchmark
schup-l2s-abp4-1-k31.cnf

Jump to solvers results

General information on the benchmark

Nameschup-l2s-abp4-1-k31.cnf
MD5SUM2ec4066bd8381455b1990aa40b382ff0
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark26.99
Satisfiable
(Un)Satisfiability was proved
Number of variables14809
Number of clauses48483
Sum of the clauses size123522
Maximum clause length33
Minimum clause length1
Number of clauses of size 136
Number of clauses of size 224983
Number of clauses of size 322191
Number of clauses of size 4589
Number of clauses of size 5403
Number of clauses of size over 5281

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
ManySAT 1.1 aimd 2/2009-03-20 (4 threads) (complete)1776652UNSAT 26.99 7.13008
ManySAT 1.1 aimd 0/2009-03-20 (4 threads) (complete)1776646UNSAT 30.75 8.01231
ManySAT 1.1 aimd 1/2009-03-20 (4 threads) (complete)1776649UNSAT 45.55 11.7548
satake 2009-03-22 (4 threads) (complete)1776655UNSAT 218.63 117.196
satake 2009-03-22 (16 threads) (complete)1776657UNSAT 532.793 321.988
ttsth-5-0 2009-03-19 (4 threads) (complete)1776658? (MO) 614.4 304.533
ttsth-5-0 2009-03-19 (16 threads) (complete)1776660? (MO) 2212.05 141.495

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: