(** * Skelet #26 *)
Set Default Goal Selector "!".
Definition tm : TM := fun '(q, s) =>
match q, s with
| A, 0 => Some (1, R, B)  | A, 1 => Some (1, L, D)
| B, 0 => Some (1, R, C)  | B, 1 => Some (0, R, B)
| C, 0 => Some (1, L, A)  | C, 1 => Some (1, R, C)
| D, 0 => Some (1, L, E)  | D, 1 => Some (0, L, A)
| E, 0 => Some (1, L, C)  | E, 1 => None
end.
Notation "c --> c'" := (c -[ tm ]-> c')   (at level 40).
Notation "c -->* c'" := (c -[ tm ]->* c') (at level 40).
Notation "c -->+ c'" := (c -[ tm ]->+ c') (at level 40).
Notation P := Pos.succ.
Definition D n a m : Q * tape :=
L n <{{D}} 1 >> 0 >> 1 >> a >> R m.
Fixpoint J' (n : positive) : side :=
match n with
| xH =>    const 0 << 1
| xO n => J' n << 0 << 0 << 0 << 0
| xI n => J' n << 0 << 0 << 0 << 1
end.
Definition J (n : N) : side :=
match n with
| N0 => const 0
| Npos n => J' n
end.
Definition E0 n a m : Q * tape :=
K n <{{D}} 1 >> 0 >> 1 >> a >> R m.
Definition E1 n a m : Q * tape :=
J n <{{D}} 1 >> 0 >> 1 >> a >> R m.

(* For k>=1, D(n, 1, 2^k-1) -->+ E1(2(n+1), 0, 2^{k-1}) *)
Theorem start_reset1 : forall n m,
all1 m ->
exists m',
(m'~0 = P m)%positive /\
D n 1 m -->+ E1 (N.double (N.succ n)) 0 m'.