rc-1

[helm.git] / matita / tests / bool.ma

diff --git a/matita/tests/bool.ma b/matita/tests/bool.ma
index a49c21cc82763a4ca6a5b3ab8f45b70b048dcb31..fe39c310fad9c62b8d1cd99954a54e6c129ab6b9 100644 (file)
--- a/matita/tests/bool.ma
+++ b/matita/tests/bool.ma
@@ -12,9 +12,9 @@
 (*                                                                        *)
 (**************************************************************************)
 
-set "baseuri" "cic:/matita/SK/".
+set "baseuri" "cic:/matita/tests/bool/".
 
-include "legacy/coq.ma".
+include "../legacy/coq.ma".
 
 alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
 alias id "eq" = "cic:/Coq/Init/Logic/eq.ind#xpointer(1/1)".
@@ -34,7 +34,7 @@ theorem SKK:
     (app (app (app S x) y) z) = (app (app x z) (app y z))).
   \forall x:A.
     (app (app (app S K) K) x) = x.
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool1:
@@ -55,7 +55,7 @@ theorem bool1:
   \forall inv1: (\forall x:A. (add x (inv x)) = one).  
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
   (inv zero) = one.
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
   
 theorem bool2:
@@ -76,7 +76,7 @@ theorem bool2:
   \forall inv1: (\forall x:A. (add x (inv x)) = one).  
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero).
   \forall x:A. (mult x zero) = zero.
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool3:
@@ -97,7 +97,7 @@ theorem bool3:
   \forall inv1: (\forall x:A. (add x (inv x)) = one).  
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero).
   \forall x:A. (inv (inv x)) = x.
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool266:
@@ -118,9 +118,9 @@ theorem bool266:
   \forall inv1: (\forall x:A. (add x (inv x)) = one).  
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero).
   \forall x,y:A. (mult x (add (inv x) y)) = (mult x y).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
-
+*)
 theorem bool507:
   \forall A:Set.
   \forall one:A.
@@ -139,9 +139,9 @@ theorem bool507:
   \forall inv1: (\forall x:A. (add x (inv x)) = one).  
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero).
   \forall x,y:A. zero = (mult x (mult (inv x) y)).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
-
+(*
 theorem bool515:
   \forall A:Set.
   \forall one:A.
@@ -160,7 +160,7 @@ theorem bool515:
   \forall inv1: (\forall x:A. (add x (inv x)) = one).  
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero).
   \forall x,y:A. zero = mult (inv x) (mult x y).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool304:
@@ -181,7 +181,7 @@ theorem bool304:
   \forall inv1: (\forall x:A. (add x (inv x)) = one).  
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero).
   \forall x,y:A. x = (mult (add y x) x).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool531:
@@ -202,7 +202,7 @@ theorem bool531:
   \forall inv1: (\forall x:A. (add x (inv x)) = one).  
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero).
   \forall x,y:A. zero = (mult (inv (add x y)) y).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool253:
@@ -223,7 +223,7 @@ theorem bool253:
   \forall inv1: (\forall x:A. (add x (inv x)) = one).  
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero).
   \forall x,y:A. (add (inv x) (mult y x)) = (add (inv x) y).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool557:
@@ -243,14 +243,9 @@ theorem bool557:
   \forall i2: (\forall x:A. (mult x one) = x).   
   \forall inv1: (\forall x:A. (add x (inv x)) = one).  
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
-  (*
-  \forall hint1: (\forall x,y:A. (add (inv x) (mult y x)) = (add (inv x) y)).
-  \forall hint2: \forall x,y:A.zero = (mult (inv x) (mult x y)). 
-  \forall hint2: (\forall x,y:A. zero = (mult (inv (add x y)) y)).
-  *)
   \forall x,y:A. 
     inv x =  (add (inv x) (inv (add y x))).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool609:
@@ -270,14 +265,9 @@ theorem bool609:
   \forall i2: (\forall x:A. (mult x one) = x).   
   \forall inv1: (\forall x:A. (add x (inv x)) = one).  
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
-  (*
-  \forall hint1: (\forall x,y:A. (add (inv x) (mult y x)) = (add (inv x) y)).
-  \forall hint2: \forall x,y:A.zero = (mult (inv x) (mult x y)). 
-  \forall hint2: (\forall x,y:A. zero = (mult (inv (add x y)) y)).
-  *)
   \forall x,y:A. 
     inv x =  (add (inv (add y x)) (inv x)).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 (*
 theorem bool260:
@@ -299,7 +289,7 @@ theorem bool260:
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
   \forall x,y,z:A. 
     add x (mult x y) = mult x (add x y).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool276:
@@ -321,7 +311,7 @@ theorem bool276:
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
   \forall x,y,z,u:A. 
     (mult (add x y) (add z (add x u))) = (add (mult (add x y) z) (add x (mult y u))).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed. 
 
 theorem bool250:
@@ -343,7 +333,7 @@ theorem bool250:
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
   \forall x,y,z:A. 
     add x (mult y z) = mult (add y x) (add x z).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed. 
 
 theorem bool756minimal:
@@ -357,7 +347,7 @@ theorem bool756minimal:
   \forall x,y,z:A. 
     add x (add y (mult y z)) = add x (add y (mult x z)).
 intros;
-auto paramodulation.
+autobatch paramodulation.
 qed.
 
 theorem bool756simplified:
@@ -376,9 +366,8 @@ theorem bool756simplified:
   \forall x,y,z:A. 
     add x (add y (mult y z)) = add x (add y (mult x z)).
 intros;
-auto paramodulation.
+autobatch paramodulation.
 qed.
-(* 46 sec. *)
 
 theorem bool756:
   \forall A:Set.
@@ -408,11 +397,10 @@ theorem bool756:
     add x y = add x (add y (mult x z)).
 intros;
 cut (mult (add y x) (add x (add y z)) = add x (add y (mult x z)));
-[auto paramodulation
-|auto paramodulation]
+[autobatch paramodulation
+|autobatch paramodulation]
 qed.
-(*  186 sec *)
-*)
+
 theorem bool756full:
   \forall A:Set.
   \forall one:A.
@@ -432,11 +420,9 @@ theorem bool756full:
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
   \forall x,y,z:A. 
     add x y = add x (add y (mult x z)).
-intros;auto paramodulation.
+intros;autobatch paramodulation.
 qed.
-(* war=5; active 225, maxmeta 172568 *)
-(* war=4; active 249, maxmeta 223220 *)
-(*
+
 theorem bool1164:
   \forall A:Set.
   \forall one:A.
@@ -456,7 +442,7 @@ theorem bool1164:
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
   \forall x,y,z:A.
     (add x y) = (add (add x (mult y z)) y).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool1230:
@@ -479,7 +465,7 @@ theorem bool1230:
   \forall x,y,z:A.
   \forall c1z: (\forall x:A.(add x z) = (add z x)). 
     add (add x y) z = add (add x y) (add z y).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool1230:
@@ -501,7 +487,7 @@ theorem bool1230:
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
   \forall x,y,z:A.
     add (add x y) z = add (add x y) (add z y).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool1372:
@@ -523,8 +509,8 @@ theorem bool1372:
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
   \forall x,y,z:A.
     add x (add y z) = add (add x z) y.
-intros.auto paramodulation.
-qed.*)
+intros.autobatch paramodulation.
+qed.
 
 theorem bool381:
   \forall A:Set.
@@ -545,7 +531,7 @@ theorem bool381:
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
   \forall x,y:A.
       add (inv x) y = add (mult x y) (inv x).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
 theorem bool5hint1:
@@ -570,9 +556,8 @@ theorem bool5hint1:
   \forall hint623:(\forall x,y:A. inv (mult x y) = add (inv x) (inv (mult x y))).
   \forall x,y:A.
     (inv (mult x y)) = (add (inv x) (inv y)).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
-(* 90 *)
 
 theorem bool5hint2:
   \forall A:Set.
@@ -595,9 +580,8 @@ theorem bool5hint2:
   \forall hint623:(\forall x,y:A. inv (mult x y) = add (inv x) (inv (mult x y))).
   \forall x,y:A.
     (inv (mult x y)) = (add (inv x) (inv y)).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
-(* 41 *)
 
 theorem bool5hint3:
   \forall A:Set.
@@ -620,9 +604,8 @@ theorem bool5hint3:
   \forall hint609:(\forall x,y:A. inv x = add (inv (add y x)) (inv x)).
   \forall x,y:A.
     (inv (mult x y)) = (add (inv x) (inv y)).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
-(* 41 *)
 
 theorem bool5:
   \forall A:Set.
@@ -643,7 +626,8 @@ theorem bool5:
   \forall inv2: (\forall x:A. (mult x (inv x)) = zero). 
   \forall x,y:A.
     (inv (mult x y)) = (add (inv x) (inv y)).
-intros.auto paramodulation.
+intros.autobatch paramodulation.
 qed.
 
-*)
+*)*)
+