SAT 2009 Competition: multithread track: solvers results per benchmarks

Result page for benchmark
RANDOM/LARGE/3SAT/UNKNOWN/10000/
unif-k3-r4.2-v10000-c42000-S1012522562-096.cnf

Jump to solvers results

General information on the benchmark

NameRANDOM/LARGE/3SAT/UNKNOWN/10000/
unif-k3-r4.2-v10000-c42000-S1012522562-096.cnf
MD5SUMbdbdcaa81df700a6beb0f62dde612ba9
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 variables10000
Number of clauses42000
Sum of the clauses size126000
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 342000
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)1777336? (TO) 3753.16 1000.03
gNovelty+-T 2009-03-22 (16 threads) (incomplete)1777338? (TO) 5000.55 321.342

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: