[r-t] Question about shortest link methods - does truth make a difference?

[Alexander E Holroyd]

Let r be a row, and consider possible sequences of non-jump changes that 
get from rounds to r.  Let D(r) be the minimum possible length of such a 
sequence.  So for example,
D(1234)=0
D(2314)=2  (the unique minimum length sequence is 34.14)
D(4321)=4  (one minimum sequence is plain hunt, -14-14).

Now let Dp(r) be the minimum length if no bell is allowed to make 3 or 
more consecutive blows in the same place.  So for example
Dp(2314)=3 (which is larger than D(2314)=2)
(34.14 is not allowed because 4 makes 3 blows in 4ths, but we can do 
12-14 instead).

Also let Dt(r) be the minimum length if the sequence of rows must be 
true, i.e. no row is allowed to be repeated.

Finally let Dpt(r) be the minimum length if it must be true AND have no 
long places.

Obviously for every row r,
D(r)<=Dp(r)<=Dpt(r) and
D(r)<=Dt(t)<=Dpt(r)

In fact it is easy to prove that for every row r
D(r)=Dt(r):
if some minimum length sequence is not true, we can just omit the rows 
between two identical rows to get a shorter sequence, a contradiction.

We saw above that for some rows r (e.g. 2314)
D(r)<Dp(r)
and because both sequences are true, this same example also has
Dt(r)<Dpt(r).

My question is:
Does Dp(r)=Dpt(r) hold for every r?
Or is there a row r for which Dp(r)<Dpt(r)?
In other words, if forbid long places, is there a row that you can get 
to quicker if you allow falseness than if you don't?