SAT 2009 Competition: multithread track: solvers results per benchmarks

Result page for benchmark
RANDOM/LARGE/3SAT/UNKNOWN/14000/
unif-k3-r4.2-v14000-c58800-S1256544997-019.cnf

Jump to solvers results

General information on the benchmark

NameRANDOM/LARGE/3SAT/UNKNOWN/14000/
unif-k3-r4.2-v14000-c58800-S1256544997-019.cnf
MD5SUM01285fb91a1e47f6ebc0bc6eca4b49ed
Bench CategoryRANDOM (random instances)
Best result obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark
Satisfiable
(Un)Satisfiability was proved
Number of variables14000
Number of clauses58800
Sum of the clauses size176400
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 358800
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
gNovelty+-T 2009-03-22 (4 threads) (incomplete)1777447? (TO) 3815.96 1000.03
gNovelty+-T 2009-03-22 (16 threads) (incomplete)1777449? (TO) 5000.85 392.138

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: