Definition compatible_rule (r:rule) : Prop :=
  match r with
    | rule_intro f _ t => forall f', In f' (functions_of_term t) -> rank f' <= rank f
  end.Definition compatible_prog : Prop :=
  forall r, In r prog -> compatible_rule r.

Lemma all_possible_subarguments_length (args: list term) : length (all_possible_subarguments args) = prodl (map (@term_size _ _ _) args).