Input decomposition theorem for parse-*-dot-1*bit.
Theorem: input-decomposition-of-parse-*-dot-1*bit
(defthm input-decomposition-of-parse-*-dot-1*bit (b* (((mv & trees rest-input) (parse-*-dot-1*bit input))) (equal (append (tree-list->string trees) rest-input) (nat-list-fix input))))