128
O. Keszocze et al.
0
5 ,000
10,000 15,000 20,000 25,000 30,000
12
14
16
18
Time in ms
Average depth of pruned nodes
0
5 ,000
10,000 15,000 20,000 25,000 30,000
16
17
18
Time in ms
Average size of learned clauses
0
5 ,000
10,000 15,000 20,000 25,000 30,000
5
6
7
Time in ms
Average number of assignments per decision
0
5 ,000
10,000 15,000 20,000 25,000 30,000
0
1,000
2,000
Time in ms
Average number of pruned nodes
Number of satisfied clauses
Clause Length
Conflict Depth
Unit Propagation
Combined
Fig. 5.13 Data collected when solving all instances in the random set 1 using an exploration
constant of 0.3
0
5 ,000
10,000 15,000 20,000 25,000 30,000
4
6
8
10
Time in ms
Average depth of pruned nodes
0
5 ,000
10,000 15,000 20,000 25,000 30,000
15
20
25
Time in ms
Average size of learned clauses
0
5 ,000
10,000 15,000 20,000 25,000 30,000
0
200
400
600
800
Time in ms
Average number of assignments per decision
0
5 ,000
10,000 15,000 20,000 25,000 30,000
0
200
400
Time in ms
Average number of pruned nodes
Number of satisfied clauses
Clause Length
Conflict Depth
Unit Propagation
Combined
Fig. 5.14 Data collected when solving all industrial and crafted instances using an exploration
constant of 0.1