claudio, please have a look at this

[helm.git] / helm / software / matita / tests / paramodulation / BOO075-1.ma

diff --git a/helm/software/matita/tests/paramodulation/BOO075-1.ma b/helm/software/matita/tests/paramodulation/BOO075-1.ma
index f5cfc7c31c45c37dd0df4c6ada0081e3c14d507e..67a89bf6ced8c428907feb02f85eed16fc742009 100644 (file)
--- a/helm/software/matita/tests/paramodulation/BOO075-1.ma
+++ b/helm/software/matita/tests/paramodulation/BOO075-1.ma
@@ -1,4 +1,4 @@
-set "baseuri" "cic:/matita/TPTP/BOO075-1".
+
 
 inductive eq (A:Type) (x:A) : A \to Prop \def refl_eq : eq A x x.
 
@@ -12,19 +12,35 @@ theorem eq_elim_r:
 intros. elim (sym_eq ? ? ? H1).assumption.
 qed.
 
+theorem eq_elim_r':
+ \forall A:Type.\forall x:A. \forall P: A \to Set.
+   P x \to \forall y:A. eq A y x \to P y.
+intros. elim (sym_eq ? ? ? H).assumption.
+qed.
+
+theorem eq_elim_r'':
+ \forall A:Type.\forall x:A. \forall P: A \to Type.
+   P x \to \forall y:A. eq A y x \to P y.
+intros. elim (sym_eq ? ? ? H).assumption.
+qed.
+
 theorem trans_eq : 
     \forall A:Type.\forall x,y,z:A. eq A x y \to eq A y z \to eq A x z.
 intros.elim H1.assumption.
 qed.
 
 default "equality"
- cic:/matita/TPTP/BOO075-1/eq.ind
- cic:/matita/TPTP/BOO075-1/sym_eq.con
- cic:/matita/TPTP/BOO075-1/trans_eq.con
- cic:/matita/TPTP/BOO075-1/eq_ind.con
- cic:/matita/TPTP/BOO075-1/eq_elim_r.con
- cic:/matita/TPTP/BOO075-1/eq_f.con
- cic:/matita/TPTP/BOO075-1/eq_f1.con.
+ cic:/matita/tests/paramodulation/BOO075-1/eq.ind
+ cic:/matita/tests/paramodulation/BOO075-1/sym_eq.con
+ cic:/matita/tests/paramodulation/BOO075-1/trans_eq.con
+ cic:/matita/tests/paramodulation/BOO075-1/eq_ind.con
+ cic:/matita/tests/paramodulation/BOO075-1/eq_elim_r.con
+ cic:/matita/tests/paramodulation/BOO075-1/eq_rec.con
+ cic:/matita/tests/paramodulation/BOO075-1/eq_elim_r'.con
+ cic:/matita/tests/paramodulation/BOO075-1/eq_rect.con
+ cic:/matita/tests/paramodulation/BOO075-1/eq_elim_r''.con
+ cic:/matita/tests/paramodulation/BOO075-1/eq_f.con
+ cic:/matita/tests/paramodulation/BOO075-1/eq_f1.con.
 
 theorem eq_f: \forall  A,B:Type.\forall f:A\to B.
   \forall x,y:A. eq A x y \to eq B (f x) (f y).
@@ -39,7 +55,7 @@ qed.
 inductive ex (A:Type) (P:A \to Prop) : Prop \def
     ex_intro: \forall x:A. P x \to ex A P.
 interpretation "exists" 'exists \eta.x =
-  (cic:/matita/TPTP/BOO075-1/ex.ind#xpointer(1/1) _ x).
+  (cic:/matita/tests/paramodulation/BOO075-1/ex.ind#xpointer(1/1) _ x).
 
 notation < "hvbox(\exists ident i opt (: ty) break . p)"
   right associative with precedence 20
@@ -78,7 +94,7 @@ theorem prove_meredith_2_basis_1:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (nand (nand A (nand (nand B A) A)) (nand B (nand C A))) B.eq Univ (nand (nand a a) (nand b a)) a
 .
 intros.
-auto paramodulation timeout=600.
+autobatch paramodulation timeout=600;
 try assumption.
 print proofterm.
 qed.