include "NLE/fwd.ma".
theorem nle_refl: \forall x. x <= x.
- intros 1; elim x; clear x; intros; auto new.
+ intros 1; elim x; clear x; intros; auto new timeout=100.
qed.
theorem nle_trans_succ: \forall x,y. x <= y \to x <= succ y.
- intros. elim H; clear H x y; intros; auto new.
+ intros. elim H; clear H x y; intros; auto new timeout=100.
qed.
theorem nle_lt_or_eq: \forall y,x. x <= y \to x < y \lor x = y.
intros 1. elim y; clear y; intros;
- [ lapply linear nle_gen_zero_2 to H. auto new
+ [ lapply linear nle_gen_zero_2 to H. auto new timeout=100
| lapply linear nle_gen_succ_2 to H1. decompose;
- [ subst. auto new
+ [ subst. auto new timeout=100
| lapply linear H to H3 as H0. decompose;
- subst; auto new
+ subst; auto new timeout=100
]
].
qed.