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