used ;try assumption instead of .try assumption

diff --git a/matita/tests/TPTP/Veloci/BOO001-1.p.ma b/matita/tests/TPTP/Veloci/BOO001-1.p.ma
index 38c012e5a6acef152bb050c35bf534f9d99c7775..87ee6a7c5ef2ec24cb645fb041c847f6ba3a2241 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO001-1.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO001-1.p.ma
@@ -59,7 +59,7 @@ theorem prove_inverse_is_self_cancelling:
 \forall H4:\forall V:Univ.\forall W:Univ.\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (multiply (multiply V W X) Y (multiply V W Z)) (multiply V W (multiply X Y Z)).eq Univ (inverse (inverse a)) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO003-2.p.ma b/matita/tests/TPTP/Veloci/BOO003-2.p.ma
index cbbae8bea25b4317746db26a2c658ec7ae6aa86e..a964a96adafa1f96ee0a4adcba20b3136be26dc1 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO003-2.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO003-2.p.ma
@@ -68,7 +68,7 @@ theorem prove_a_times_a_is_a:
 \forall H13:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (multiply a a) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO003-4.p.ma b/matita/tests/TPTP/Veloci/BOO003-4.p.ma
index b5fed12aca2086034c526b9417b5792948fd5e08..efeca0198000e510f66a447b80eaee7c31276f8a 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO003-4.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO003-4.p.ma
@@ -62,7 +62,7 @@ theorem prove_a_times_a_is_a:
 \forall H7:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (multiply a a) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO004-2.p.ma b/matita/tests/TPTP/Veloci/BOO004-2.p.ma
index cd5cb41d879b7949db3762fd947bbaa62b30b64c..ff3cd85f9d981971f26e7d68178e17bbe7ce4311 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO004-2.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO004-2.p.ma
@@ -68,7 +68,7 @@ theorem prove_a_plus_a_is_a:
 \forall H13:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add a a) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO004-4.p.ma b/matita/tests/TPTP/Veloci/BOO004-4.p.ma
index c173d004c30a58dbb1ba2bc4792f3b1fd4ce95c6..1821077fe184515ce80097268c01852af15c3997 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO004-4.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO004-4.p.ma
@@ -62,7 +62,7 @@ theorem prove_a_plus_a_is_a:
 \forall H7:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add a a) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO005-2.p.ma b/matita/tests/TPTP/Veloci/BOO005-2.p.ma
index e3e65f488601de6b050344711569f9f599629a74..5e3def47cfab7661db321691943a212667bffa58 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO005-2.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO005-2.p.ma
@@ -69,7 +69,7 @@ theorem prove_a_plus_1_is_a:
 \forall H13:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add a multiplicative_identity) multiplicative_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO005-4.p.ma b/matita/tests/TPTP/Veloci/BOO005-4.p.ma
index 655401b3430ca1f75779d6c6fed7c87da728b7b3..9bd9ce8a9ea36ef6ad0959b3fc5a1c24ddccc980 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO005-4.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO005-4.p.ma
@@ -63,7 +63,7 @@ theorem prove_a_plus_1_is_a:
 \forall H7:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add a multiplicative_identity) multiplicative_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO006-2.p.ma b/matita/tests/TPTP/Veloci/BOO006-2.p.ma
index 69b96f774a3af4151c83b525a0315d35273a9331..77ea2d76bf3aae0b2f38c98b1f4f687fccaeaffa 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO006-2.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO006-2.p.ma
@@ -68,7 +68,7 @@ theorem prove_right_identity:
 \forall H13:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (multiply a additive_identity) additive_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO006-4.p.ma b/matita/tests/TPTP/Veloci/BOO006-4.p.ma
index 6b9db399f168bb121a629ddd02d57b8a09f110fb..c05bd84fce1db9248bde947189231ba9b1366ecf 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO006-4.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO006-4.p.ma
@@ -62,7 +62,7 @@ theorem prove_right_identity:
 \forall H7:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (multiply a additive_identity) additive_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO009-2.p.ma b/matita/tests/TPTP/Veloci/BOO009-2.p.ma
index 201ba75c35a65d9b48caa105b4b4653dd4a4bef2..ce93dc23b18d06fbf2cebd42df1a05f2271bbb84 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO009-2.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO009-2.p.ma
@@ -69,7 +69,7 @@ theorem prove_operation:
 \forall H13:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (multiply a (add a b)) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO009-4.p.ma b/matita/tests/TPTP/Veloci/BOO009-4.p.ma
index 1987e3b12537f09fb03fe76446e59e52f0b3bba1..67631beb7b8adababcce56bd99799faf58ee4ad7 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO009-4.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO009-4.p.ma
@@ -63,7 +63,7 @@ theorem prove_operation:
 \forall H7:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (multiply a (add a b)) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO010-2.p.ma b/matita/tests/TPTP/Veloci/BOO010-2.p.ma
index f177f9c744440f3f9e00400a1294ce5957b8e4d3..9517fa3ed9c30748c84ac61fc51d7add1fa82c88 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO010-2.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO010-2.p.ma
@@ -69,7 +69,7 @@ theorem prove_a_plus_ab_is_a:
 \forall H13:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add a (multiply a b)) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO010-4.p.ma b/matita/tests/TPTP/Veloci/BOO010-4.p.ma
index 7b22061dfb57974ba5b6445fabaf6af8811ba7a8..6cd030d5a40a5716a2bf33110dfaf523f8533868 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO010-4.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO010-4.p.ma
@@ -63,7 +63,7 @@ theorem prove_a_plus_ab_is_a:
 \forall H7:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add a (multiply a b)) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO011-2.p.ma b/matita/tests/TPTP/Veloci/BOO011-2.p.ma
index b0c35a76773c0145102f96e124c3218881ec569f..33f8f9a87e65a036bde1c02b2debe76f3235d276 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO011-2.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO011-2.p.ma
@@ -69,7 +69,7 @@ theorem prove_inverse_of_1_is_0:
 \forall H13:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (inverse additive_identity) multiplicative_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO011-4.p.ma b/matita/tests/TPTP/Veloci/BOO011-4.p.ma
index 3353f8df4d77677a5e685873ea01e03230e04334..5855e8aee83b790f485be6c605cfdbdcffed394e 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO011-4.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO011-4.p.ma
@@ -62,7 +62,7 @@ theorem prove_inverse_of_1_is_0:
 \forall H7:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (inverse additive_identity) multiplicative_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO012-2.p.ma b/matita/tests/TPTP/Veloci/BOO012-2.p.ma
index 209840c60ad95d439ce1da0f2fe60cc9c0bd4e38..3572d87508f60ec9b8043bf4b973bd21f9119bf9 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO012-2.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO012-2.p.ma
@@ -68,7 +68,7 @@ theorem prove_inverse_is_an_involution:
 \forall H13:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (inverse (inverse x)) x
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO012-4.p.ma b/matita/tests/TPTP/Veloci/BOO012-4.p.ma
index a3bfe1c4bb6bb36d28c48aa199a9076f3e20d17a..fb67030b9686885d6b0533b556e6933d5255871c 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO012-4.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO012-4.p.ma
@@ -62,7 +62,7 @@ theorem prove_inverse_is_an_involution:
 \forall H7:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (inverse (inverse x)) x
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO013-2.p.ma b/matita/tests/TPTP/Veloci/BOO013-2.p.ma
index 1b7800d75d328adbf9dae7164e852ca271bf0014..0f538a7dabb347d71ff388b91b745c6b211687dd 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO013-2.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO013-2.p.ma
@@ -76,7 +76,7 @@ theorem prove_b_is_a:
 \forall H17:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ b c
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO013-4.p.ma b/matita/tests/TPTP/Veloci/BOO013-4.p.ma
index 446b2b4736f548961176eccf963f365694f63971..f4b986a977bf27e2c12992dbcb535e9083a4b459 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO013-4.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO013-4.p.ma
@@ -65,7 +65,7 @@ theorem prove_a_inverse_is_b:
 \forall H9:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ b (inverse a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO016-2.p.ma b/matita/tests/TPTP/Veloci/BOO016-2.p.ma
index a8d1ab9e7e1bb4e03d2afb609fa11554fb06b99a..ee7c9969c873245f72bb58c1f843409aac6f3457 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO016-2.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO016-2.p.ma
@@ -71,7 +71,7 @@ theorem prove_sum:
 \forall H14:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add x z) x
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO017-2.p.ma b/matita/tests/TPTP/Veloci/BOO017-2.p.ma
index 60ded0c1a507e35f95b342f132d2c6b318a7e11a..5691fcfb0e701304e5510afdb98f9faf3c7a49e6 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO017-2.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO017-2.p.ma
@@ -71,7 +71,7 @@ theorem prove_sum:
 \forall H14:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (multiply x z) x
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO018-4.p.ma b/matita/tests/TPTP/Veloci/BOO018-4.p.ma
index 8e2774c340670c7d6eda610cd00b254f436fe998..32fe9a4601e650f82e53318d84db21588d55d64d 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO018-4.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO018-4.p.ma
@@ -62,7 +62,7 @@ theorem prove_inverse_of_1_is_0:
 \forall H7:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (inverse multiplicative_identity) additive_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO034-1.p.ma b/matita/tests/TPTP/Veloci/BOO034-1.p.ma
index e1f26e13d0ab99f5d6af560cf7df7be95671939a..adab6c4ae56121395d0ef5776f5c9951563e0c45 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO034-1.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO034-1.p.ma
@@ -68,7 +68,7 @@ theorem prove_single_axiom:
 \forall H4:\forall V:Univ.\forall W:Univ.\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (multiply (multiply V W X) Y (multiply V W Z)) (multiply V W (multiply X Y Z)).eq Univ (multiply (multiply a (inverse a) b) (inverse (multiply (multiply c d e) f (multiply c d g))) (multiply d (multiply g f e) c)) b
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO069-1.p.ma b/matita/tests/TPTP/Veloci/BOO069-1.p.ma
index f76194c67a8484a824b8a60adf4a4509f1e2e422..38bbe0e44cd21a4d8a6edf0b49886c23d69294b1 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO069-1.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO069-1.p.ma
@@ -31,7 +31,7 @@ theorem prove_tba_axioms_3:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.\forall D:Univ.\forall E:Univ.\forall F:Univ.\forall G:Univ.eq Univ (multiply (multiply A (inverse A) B) (inverse (multiply (multiply C D E) F (multiply C D G))) (multiply D (multiply G F E) C)) B.eq Univ (multiply a b (inverse b)) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO071-1.p.ma b/matita/tests/TPTP/Veloci/BOO071-1.p.ma
index 806df9654167120a3c5ce045fa04d3117c70069c..1cddbb9ae11151e5971edbc7606e224d2dafd874 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO071-1.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO071-1.p.ma
@@ -31,7 +31,7 @@ theorem prove_tba_axioms_5:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.\forall D:Univ.\forall E:Univ.\forall F:Univ.\forall G:Univ.eq Univ (multiply (multiply A (inverse A) B) (inverse (multiply (multiply C D E) F (multiply C D G))) (multiply D (multiply G F E) C)) B.eq Univ (multiply (inverse b) b a) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/BOO075-1.p.ma b/matita/tests/TPTP/Veloci/BOO075-1.p.ma
index 7f6d96d3c4cf6f929eafe179fd9b166fb66bd139..971fa231a4d82f9e285b9ef01f86becdfe7b8756 100644 (file)
--- a/matita/tests/TPTP/Veloci/BOO075-1.p.ma
+++ b/matita/tests/TPTP/Veloci/BOO075-1.p.ma
@@ -30,7 +30,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.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL004-3.p.ma b/matita/tests/TPTP/Veloci/COL004-3.p.ma
index d88025c42652e460d627bdedfa6fc6ff7a8e89b9..f9a7712ee0a9bd2a06afe715a21fd2f564a84359 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL004-3.p.ma
+++ b/matita/tests/TPTP/Veloci/COL004-3.p.ma
@@ -36,7 +36,7 @@ theorem prove_u_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply s X) Y) Z) (apply (apply X Z) (apply Y Z)).eq Univ (apply (apply (apply (apply s (apply k (apply s (apply (apply s k) k)))) (apply (apply s (apply (apply s k) k)) (apply (apply s k) k))) x) y) (apply y (apply (apply x x) y))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL007-1.p.ma b/matita/tests/TPTP/Veloci/COL007-1.p.ma
index 7018646d33cce008f686faabec5faa78c04f1513..655b2a2ce202c5c6c8a28adaf58f36e41f8440db 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL007-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL007-1.p.ma
@@ -35,7 +35,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL008-1.p.ma b/matita/tests/TPTP/Veloci/COL008-1.p.ma
index deee838a4f14a535657e9bd31ea78e251001a327..a3ff086db56d6f3a43af4d0c754a4df861fb7241 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL008-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL008-1.p.ma
@@ -39,7 +39,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL010-1.p.ma b/matita/tests/TPTP/Veloci/COL010-1.p.ma
index 61e95267a84f9403ea1535420a13ccd648c1e776..45bd7de31dc775858c2adf269029ad2ce7c40b67 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL010-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL010-1.p.ma
@@ -38,7 +38,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL012-1.p.ma b/matita/tests/TPTP/Veloci/COL012-1.p.ma
index 5aba07935fb3a857e48222a59d3bdb0fb8d26a65..866be51782a686d776ec4fb3743e05c29a7ff5d2 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL012-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL012-1.p.ma
@@ -35,7 +35,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL013-1.p.ma b/matita/tests/TPTP/Veloci/COL013-1.p.ma
index ee3f5f7ba8f5c6b74ac51778a0fd4fd24488f40c..07d594e3c3598aa7295aad7ef04815ec5dd31690 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL013-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL013-1.p.ma
@@ -38,7 +38,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL014-1.p.ma b/matita/tests/TPTP/Veloci/COL014-1.p.ma
index ef4e82eddbb388c3cf6b853f3101b07ea87468c8..6e618736a5958586c7e32e456745ccde432ef3e7 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL014-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL014-1.p.ma
@@ -38,7 +38,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL015-1.p.ma b/matita/tests/TPTP/Veloci/COL015-1.p.ma
index 2f4b472726b1de37974f696a7e882f1eefaa4e1f..fcff6921ce034768a05eadb158d3486f0a8bea4e 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL015-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL015-1.p.ma
@@ -37,7 +37,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL016-1.p.ma b/matita/tests/TPTP/Veloci/COL016-1.p.ma
index b655e805ab5ff4513b4cf1f08b68c0a526bda465..37a3765cb2935d41e6a40f9965e6196ca8b1b8a7 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL016-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL016-1.p.ma
@@ -40,7 +40,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL017-1.p.ma b/matita/tests/TPTP/Veloci/COL017-1.p.ma
index eb063cf1ec649cf5de944729128c637ea46f013f..36d03e6e531cf3b62b749368759053f36bf1ffca 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL017-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL017-1.p.ma
@@ -40,7 +40,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL018-1.p.ma b/matita/tests/TPTP/Veloci/COL018-1.p.ma
index 87b023fdf767ddb0357123ec0a86159bf69cbbec..e218bae4a2edc136e613a9a8f655bfda3ddeafab 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL018-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL018-1.p.ma
@@ -40,7 +40,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL021-1.p.ma b/matita/tests/TPTP/Veloci/COL021-1.p.ma
index 6125379462a0a143b2abbed42046bc3b0be06a1c..e8f9c357920943a0bd5197fc9de00a488294b1c2 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL021-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL021-1.p.ma
@@ -40,7 +40,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL022-1.p.ma b/matita/tests/TPTP/Veloci/COL022-1.p.ma
index 866d0abd70a72aa12d6446f7b5df26064c06d8dd..a311f146f36dbd105659d7ab164cae39f93102e4 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL022-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL022-1.p.ma
@@ -40,7 +40,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL024-1.p.ma b/matita/tests/TPTP/Veloci/COL024-1.p.ma
index 5476a13a10b6192fbe24b9033a30cc8c5f03d84f..c38e405742d7f15c4668094f68ced50c58871164 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL024-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL024-1.p.ma
@@ -40,7 +40,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL025-1.p.ma b/matita/tests/TPTP/Veloci/COL025-1.p.ma
index d5c98aabfe802f7ff26b22d526b70f1a120633c4..a7fa25856d4959da026e9cfeef27cf7ddddc8723 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL025-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL025-1.p.ma
@@ -39,7 +39,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL045-1.p.ma b/matita/tests/TPTP/Veloci/COL045-1.p.ma
index 6ea3f3676dd92e3833ae2e727fb23992e36ca1d6..df48469b03da74f4c752d0c52109fbe372040793 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL045-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL045-1.p.ma
@@ -40,7 +40,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL048-1.p.ma b/matita/tests/TPTP/Veloci/COL048-1.p.ma
index bee9580b08c91ed76d2dca01528309101d620325..a0435b2c2b3da254f5b71bb9e31870739b4dfc88 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL048-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL048-1.p.ma
@@ -40,7 +40,7 @@ theorem prove_fixed_point:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL050-1.p.ma b/matita/tests/TPTP/Veloci/COL050-1.p.ma
index 716626e843c933c49bb3df72d0a14d53736ac34c..10f25dc2a4ba8ee28476bcea15139bb6fc5eeaed 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL050-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL050-1.p.ma
@@ -47,7 +47,7 @@ theorem prove_all_fond_of_another:
 intros.
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL058-2.p.ma b/matita/tests/TPTP/Veloci/COL058-2.p.ma
index b0e94a980c1e776ead4d1c311e84f3a27c59a91e..5b216a3d2bf2cfc9cbd58678218c157cf03a2378 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL058-2.p.ma
+++ b/matita/tests/TPTP/Veloci/COL058-2.p.ma
@@ -35,7 +35,7 @@ theorem prove_the_bird_exists:
 \forall H0:\forall X1:Univ.\forall X2:Univ.eq Univ (response (response lark X1) X2) (response X1 (response X2 X2)).eq Univ (response (response (response lark (response (response lark (response lark lark)) (response lark (response lark lark)))) (response lark (response lark lark))) (response (response lark (response (response lark (response lark lark)) (response lark (response lark lark)))) (response lark (response lark lark)))) (response (response lark (response (response lark (response lark lark)) (response lark (response lark lark)))) (response lark (response lark lark)))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL058-3.p.ma b/matita/tests/TPTP/Veloci/COL058-3.p.ma
index 32802b0c56177bcd74497892b06722531bb7103b..2235cb57dae2bb5718682d40a44d6f19b8f4c2c3 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL058-3.p.ma
+++ b/matita/tests/TPTP/Veloci/COL058-3.p.ma
@@ -35,7 +35,7 @@ theorem prove_the_bird_exists:
 \forall H0:\forall X1:Univ.\forall X2:Univ.eq Univ (response (response lark X1) X2) (response X1 (response X2 X2)).eq Univ (response (response (response (response lark lark) (response lark (response lark lark))) (response lark (response lark lark))) (response (response (response lark lark) (response lark (response lark lark))) (response lark (response lark lark)))) (response (response (response lark lark) (response lark (response lark lark))) (response lark (response lark lark)))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL060-2.p.ma b/matita/tests/TPTP/Veloci/COL060-2.p.ma
index 8ed2fdd81a03e4b84c40e1db6db16553ae54e896..da151819a1935324df6ec9df466dc6164bc2fd99 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL060-2.p.ma
+++ b/matita/tests/TPTP/Veloci/COL060-2.p.ma
@@ -39,7 +39,7 @@ theorem prove_q_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply t b)) (apply (apply b b) t)) x) y) z) (apply y (apply x z))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL060-3.p.ma b/matita/tests/TPTP/Veloci/COL060-3.p.ma
index e33abe6e76eb5eaf5d5f9d5630565051abc693ca..d1ff7bc9b7c9b83290cf9c83478d6fc2e977c5f2 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL060-3.p.ma
+++ b/matita/tests/TPTP/Veloci/COL060-3.p.ma
@@ -39,7 +39,7 @@ theorem prove_q_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply (apply b (apply t b)) b)) t) x) y) z) (apply y (apply x z))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL061-2.p.ma b/matita/tests/TPTP/Veloci/COL061-2.p.ma
index 14e0f74a0378636bda13328112d6875a0064fdb1..81adc265def07253753357e7cf017873f453673a 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL061-2.p.ma
+++ b/matita/tests/TPTP/Veloci/COL061-2.p.ma
@@ -39,7 +39,7 @@ theorem prove_q1_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply t t)) (apply (apply b b) b)) x) y) z) (apply x (apply z y))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL061-3.p.ma b/matita/tests/TPTP/Veloci/COL061-3.p.ma
index ca9a9653d69ad03525cd49477680160a4bc07d9f..0359b3ce91059c0da7f51b22998a1eceb9f10354 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL061-3.p.ma
+++ b/matita/tests/TPTP/Veloci/COL061-3.p.ma
@@ -39,7 +39,7 @@ theorem prove_q1_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply (apply b (apply t t)) b)) b) x) y) z) (apply x (apply z y))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL062-2.p.ma b/matita/tests/TPTP/Veloci/COL062-2.p.ma
index 839f6ae9376d5869c217fc461dc08a9a17955141..383a285e879718c742c3a41343966d24d091631d 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL062-2.p.ma
+++ b/matita/tests/TPTP/Veloci/COL062-2.p.ma
@@ -39,7 +39,7 @@ theorem prove_c_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply t (apply (apply b b) t))) (apply (apply b b) t)) x) y) z) (apply (apply x z) y)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL062-3.p.ma b/matita/tests/TPTP/Veloci/COL062-3.p.ma
index 5b8ad716ec42d3c069c5b712b8a48628c56c73c3..8b65e0c4f1d3ab22591133206e225c3abe33bb63 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL062-3.p.ma
+++ b/matita/tests/TPTP/Veloci/COL062-3.p.ma
@@ -39,7 +39,7 @@ theorem prove_c_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply (apply b (apply t (apply (apply b b) t))) b)) t) x) y) z) (apply (apply x z) y)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL063-2.p.ma b/matita/tests/TPTP/Veloci/COL063-2.p.ma
index 31a6ae8ec3241d86dc109b2f036e9e4820255139..02f91ef49277a892a6d161db188b2151efd4b9a0 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL063-2.p.ma
+++ b/matita/tests/TPTP/Veloci/COL063-2.p.ma
@@ -39,7 +39,7 @@ theorem prove_f_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply t t)) (apply (apply b b) (apply (apply b b) t))) x) y) z) (apply (apply z y) x)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL063-3.p.ma b/matita/tests/TPTP/Veloci/COL063-3.p.ma
index 1c5133b0ef3f1cf7492e810f38e54d71e70a2cbb..70205ee89d75bf3182d67a7f968e67853f2bc3df 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL063-3.p.ma
+++ b/matita/tests/TPTP/Veloci/COL063-3.p.ma
@@ -39,7 +39,7 @@ theorem prove_f_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply (apply b (apply t t)) b)) (apply (apply b b) t)) x) y) z) (apply (apply z y) x)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL063-4.p.ma b/matita/tests/TPTP/Veloci/COL063-4.p.ma
index b341b737b43cc10d435958c451484aa7ef24e49d..38bb353180ec54a418bbfcae1a73e27b9e8552aa 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL063-4.p.ma
+++ b/matita/tests/TPTP/Veloci/COL063-4.p.ma
@@ -39,7 +39,7 @@ theorem prove_f_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply t t)) (apply (apply b (apply (apply b b) b)) t)) x) y) z) (apply (apply z y) x)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL063-5.p.ma b/matita/tests/TPTP/Veloci/COL063-5.p.ma
index 22976148e4b600aae95a4e6af2ca837738eb6377..4c98273b5327d01dfac4b2e5bb460e622e84a5f5 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL063-5.p.ma
+++ b/matita/tests/TPTP/Veloci/COL063-5.p.ma
@@ -39,7 +39,7 @@ theorem prove_f_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply (apply b (apply t t)) (apply (apply b b) b))) t) x) y) z) (apply (apply z y) x)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL063-6.p.ma b/matita/tests/TPTP/Veloci/COL063-6.p.ma
index b7c423748ff7c9f06362870f5114faee8e8421d4..19fbd39faf6c9c64b9d83e8f29d0e368fc8a6db7 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL063-6.p.ma
+++ b/matita/tests/TPTP/Veloci/COL063-6.p.ma
@@ -39,7 +39,7 @@ theorem prove_f_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply (apply b (apply (apply b (apply t t)) b)) b)) t) x) y) z) (apply (apply z y) x)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL064-2.p.ma b/matita/tests/TPTP/Veloci/COL064-2.p.ma
index 5b45bc7ea1452aa3bfac6e95ecdb4dfb2a0c82b4..4e6d8af15cca289e896f987c6a34da475c678c74 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL064-2.p.ma
+++ b/matita/tests/TPTP/Veloci/COL064-2.p.ma
@@ -39,7 +39,7 @@ theorem prove_v_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply t (apply (apply b b) t))) (apply (apply b b) (apply (apply b b) t))) x) y) z) (apply (apply z x) y)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL064-3.p.ma b/matita/tests/TPTP/Veloci/COL064-3.p.ma
index 88b85eb9bda68fb51a0f0a7164aab7cc1a267738..5644d38c109d592dd72135809714647b7d22f047 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL064-3.p.ma
+++ b/matita/tests/TPTP/Veloci/COL064-3.p.ma
@@ -39,7 +39,7 @@ theorem prove_v_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply (apply b (apply t (apply (apply b b) t))) b)) (apply (apply b b) t)) x) y) z) (apply (apply z x) y)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL064-4.p.ma b/matita/tests/TPTP/Veloci/COL064-4.p.ma
index c1690d0652a167cffcfa94a5b149b74c094e152e..34fbe93490b1a5902b886e529680b8fd4797425c 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL064-4.p.ma
+++ b/matita/tests/TPTP/Veloci/COL064-4.p.ma
@@ -39,7 +39,7 @@ theorem prove_v_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply t (apply (apply b b) t))) (apply (apply b (apply (apply b b) b)) t)) x) y) z) (apply (apply z x) y)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL064-5.p.ma b/matita/tests/TPTP/Veloci/COL064-5.p.ma
index 989b3c1bff71b1f9556cdcd8e459c6d1feadb3b0..4148875880cdf54501d5131e14630aadefad5374 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL064-5.p.ma
+++ b/matita/tests/TPTP/Veloci/COL064-5.p.ma
@@ -39,7 +39,7 @@ theorem prove_v_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply (apply b (apply t (apply (apply b b) t))) (apply (apply b b) b))) t) x) y) z) (apply (apply z x) y)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL064-6.p.ma b/matita/tests/TPTP/Veloci/COL064-6.p.ma
index cb5635f98c969850cfea8d9b98b91e1088d5e197..4d054e0352b6950eb4252087be548f217149bca4 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL064-6.p.ma
+++ b/matita/tests/TPTP/Veloci/COL064-6.p.ma
@@ -39,7 +39,7 @@ theorem prove_v_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply (apply b (apply (apply b (apply t (apply (apply b b) t))) b)) b)) t) x) y) z) (apply (apply z x) y)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL064-7.p.ma b/matita/tests/TPTP/Veloci/COL064-7.p.ma
index d7a0a9cabf5f7882288a9a6c20aeb63abf5483f4..1c3ddc2f26c1e969c1053872ad34bf49f737b9b2 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL064-7.p.ma
+++ b/matita/tests/TPTP/Veloci/COL064-7.p.ma
@@ -39,7 +39,7 @@ theorem prove_v_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply t (apply (apply b b) t))) (apply (apply b b) (apply (apply b t) t))) x) y) z) (apply (apply z x) y)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL064-8.p.ma b/matita/tests/TPTP/Veloci/COL064-8.p.ma
index 89111c67994fe927718c431725412674bb86922f..120a6d0477845a8577589916b4879d68cb0a5cdf 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL064-8.p.ma
+++ b/matita/tests/TPTP/Veloci/COL064-8.p.ma
@@ -39,7 +39,7 @@ theorem prove_v_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply (apply b (apply t (apply (apply b b) t))) b)) (apply (apply b t) t)) x) y) z) (apply (apply z x) y)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL064-9.p.ma b/matita/tests/TPTP/Veloci/COL064-9.p.ma
index 8e6ad6cdb5640fb859382b4795d2a83c1e8a59e8..07591bb4c27a16c7a7ca707364f2c1494ad1c86d 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL064-9.p.ma
+++ b/matita/tests/TPTP/Veloci/COL064-9.p.ma
@@ -39,7 +39,7 @@ theorem prove_v_combinator:
 \forall H1:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (apply (apply (apply b X) Y) Z) (apply X (apply Y Z)).eq Univ (apply (apply (apply (apply (apply b (apply t (apply (apply b b) t))) (apply (apply b (apply (apply b b) t)) t)) x) y) z) (apply (apply z x) y)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/COL083-1.p.ma b/matita/tests/TPTP/Veloci/COL083-1.p.ma
index 870b7d8629351676345276025fda2c1d6c043a0c..89d99176182dd9d1d7815561698cba2965e51c44 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL083-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL083-1.p.ma
@@ -35,7 +35,7 @@ exists[
 2:
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL084-1.p.ma b/matita/tests/TPTP/Veloci/COL084-1.p.ma
index f345021bf5ff2ab0abdac09d0c9785bd21e5c279..4d2d057bc7863ea7f064192b3e98432b42df4ea3 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL084-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL084-1.p.ma
@@ -35,7 +35,7 @@ exists[
 2:
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL085-1.p.ma b/matita/tests/TPTP/Veloci/COL085-1.p.ma
index ff1981363c952a82d8e533bc52c5a2db3c51607b..7fd4279ce760250ef928c3dcec3eee4cb21953fe 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL085-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL085-1.p.ma
@@ -33,7 +33,7 @@ exists[
 2:
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/COL086-1.p.ma b/matita/tests/TPTP/Veloci/COL086-1.p.ma
index 030c2cd33498cbfef8ba8c1a52989c4467da1bc9..e4527c48bfdcc66c929401ec121aeac6856688be 100644 (file)
--- a/matita/tests/TPTP/Veloci/COL086-1.p.ma
+++ b/matita/tests/TPTP/Veloci/COL086-1.p.ma
@@ -33,7 +33,7 @@ exists[
 2:
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/GRP001-2.p.ma b/matita/tests/TPTP/Veloci/GRP001-2.p.ma
index c695b7f80d96bfa778a938e02eac126d723b8799..d4e79c748543b1299cf6ec9c91d062bc1bea4ca8 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP001-2.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP001-2.p.ma
@@ -79,7 +79,7 @@ theorem prove_b_times_a_is_c:
 \forall H6:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (multiply b a) c
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP001-4.p.ma b/matita/tests/TPTP/Veloci/GRP001-4.p.ma
index ea943fdd8e170267dd986afb65f9e86e0efdf6e8..544eaf116a2bcfe37e4017c1dc442cc9af28359a 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP001-4.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP001-4.p.ma
@@ -40,7 +40,7 @@ theorem prove_b_times_a_is_c:
 \forall H3:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (multiply (multiply X Y) Z) (multiply X (multiply Y Z)).eq Univ (multiply b a) c
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP010-4.p.ma b/matita/tests/TPTP/Veloci/GRP010-4.p.ma
index ce5111529eb0bdecd5b2b82e5817f366dd244344..b6a3f51c1deec912d6532d04a49156b4f80018c8 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP010-4.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP010-4.p.ma
@@ -38,7 +38,7 @@ theorem prove_b_times_c_is_e:
 \forall H3:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (multiply (multiply X Y) Z) (multiply X (multiply Y Z)).eq Univ (multiply b c) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP011-4.p.ma b/matita/tests/TPTP/Veloci/GRP011-4.p.ma
index d11f4a5f4f3ee40b2f4f53570cc1e77947299a55..6391656ba4683abb198a3ca885037fe771df953f 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP011-4.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP011-4.p.ma
@@ -39,7 +39,7 @@ theorem prove_left_cancellation:
 \forall H3:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (multiply (multiply X Y) Z) (multiply X (multiply Y Z)).eq Univ b d
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP012-4.p.ma b/matita/tests/TPTP/Veloci/GRP012-4.p.ma
index 4d7966963ded817604664732f9292372addfc7a3..ed5338825ad7f9a8f5cc222bcfe6cf493b6f135e 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP012-4.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP012-4.p.ma
@@ -71,7 +71,7 @@ theorem prove_inverse_of_product_is_product_of_inverses:
 \forall H4:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (inverse (multiply a b)) (multiply (inverse b) (inverse a))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP022-2.p.ma b/matita/tests/TPTP/Veloci/GRP022-2.p.ma
index 034f854c3a203463db8a7c08a99695d6a2823d29..db2519fe64e19162d7ded84ca116bac3b26826eb 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP022-2.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP022-2.p.ma
@@ -71,7 +71,7 @@ theorem prove_inverse_of_inverse_is_original:
 \forall H4:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (inverse (inverse a)) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP023-2.p.ma b/matita/tests/TPTP/Veloci/GRP023-2.p.ma
index f5cb3725201b299016314831ac2870321d946a49..4ad3522010521e1bd40386bd6d51321b57ff972b 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP023-2.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP023-2.p.ma
@@ -68,7 +68,7 @@ theorem prove_inverse_of_id_is_id:
 \forall H4:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (inverse identity) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP115-1.p.ma b/matita/tests/TPTP/Veloci/GRP115-1.p.ma
index dafda9a6ed4a254191a47dd14bd74a1e293da8ae..6c605ee94c2e2b384301ad8b16f8c049aef2320e 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP115-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP115-1.p.ma
@@ -29,7 +29,7 @@ theorem prove_order3:
 \forall H0:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (multiply X (multiply (multiply X (multiply (multiply X Y) Z)) (multiply identity (multiply Z Z)))) Y.eq Univ (multiply a (multiply a a)) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP116-1.p.ma b/matita/tests/TPTP/Veloci/GRP116-1.p.ma
index d7895138bc93f38493202e2f5c7bd76c103af0a3..3cc4b571918bd4ea178c6212fe2f75e6a63e995d 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP116-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP116-1.p.ma
@@ -29,7 +29,7 @@ theorem prove_order3:
 \forall H0:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (multiply X (multiply (multiply X (multiply (multiply X Y) Z)) (multiply identity (multiply Z Z)))) Y.eq Univ (multiply identity a) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP117-1.p.ma b/matita/tests/TPTP/Veloci/GRP117-1.p.ma
index 2d04443b6716fd2448588b48966bc28e59936e4c..8768d0eabb13162282b643a2a94dcf4b37a54aed 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP117-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP117-1.p.ma
@@ -29,7 +29,7 @@ theorem prove_order3:
 \forall H0:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (multiply X (multiply (multiply X (multiply (multiply X Y) Z)) (multiply identity (multiply Z Z)))) Y.eq Univ (multiply a identity) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP118-1.p.ma b/matita/tests/TPTP/Veloci/GRP118-1.p.ma
index d348a57dbc1e2f0bb246c3450b8a4f200e0c8255..4d01353ea3a9103e520263b39a9bf946c14e460c 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP118-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP118-1.p.ma
@@ -31,7 +31,7 @@ theorem prove_order3:
 \forall H0:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (multiply X (multiply (multiply X (multiply (multiply X Y) Z)) (multiply identity (multiply Z Z)))) Y.eq Univ (multiply (multiply a b) c) (multiply a (multiply b c))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP136-1.p.ma b/matita/tests/TPTP/Veloci/GRP136-1.p.ma
index b3380a855d81488f79aa764178478b7b7d988a0f..e108ae55b755b1a5fda985385231ea3fbb49f5fc 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP136-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP136-1.p.ma
@@ -112,7 +112,7 @@ theorem prove_ax_antisyma:
 \forall H16:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ a b
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP137-1.p.ma b/matita/tests/TPTP/Veloci/GRP137-1.p.ma
index 34885590c0390a164e840efaf91bc89d19733fd7..322702cc5216844838e87c8367a2cb7611eb5683 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP137-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP137-1.p.ma
@@ -112,7 +112,7 @@ theorem prove_ax_antisymb:
 \forall H16:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ a b
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP139-1.p.ma b/matita/tests/TPTP/Veloci/GRP139-1.p.ma
index 1e3644eae889f5d21b5643976aa9e043556717c9..cf868c306d297e7d0c57d8cefdb0f4c0314a21f3 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP139-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP139-1.p.ma
@@ -115,7 +115,7 @@ theorem prove_ax_glb1b:
 \forall H16:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound (greatest_lower_bound a b) c) c
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP141-1.p.ma b/matita/tests/TPTP/Veloci/GRP141-1.p.ma
index 6b7b50871462459639ac3178601c9561a13b78cd..3706a25d796c92b5102fe3f8c06334436f4c9287 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP141-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP141-1.p.ma
@@ -115,7 +115,7 @@ theorem prove_ax_glb1d:
 \forall H16:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound (greatest_lower_bound a b) c) c
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP142-1.p.ma b/matita/tests/TPTP/Veloci/GRP142-1.p.ma
index ac52f8966b158b3e35704f96abef5d39c35c1353..1f13705e185b2d4838e9f5b5dd8846dd056b9be4 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP142-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP142-1.p.ma
@@ -110,7 +110,7 @@ theorem prove_ax_glb2a:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (greatest_lower_bound a b) a) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP143-1.p.ma b/matita/tests/TPTP/Veloci/GRP143-1.p.ma
index cefbb9734eba03bf391cf47c9360f60c74a10d67..be00186aee85756b397f45f8fc51330599ecf5f4 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP143-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP143-1.p.ma
@@ -110,7 +110,7 @@ theorem prove_ax_glb2b:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound (greatest_lower_bound a b) a) (greatest_lower_bound a b)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP144-1.p.ma b/matita/tests/TPTP/Veloci/GRP144-1.p.ma
index 920463e1224ae949e48c1ae6bba5616e235df5db..be20f19019120fe0c45622ffc286f3150f7461b9 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP144-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP144-1.p.ma
@@ -110,7 +110,7 @@ theorem prove_ax_glb3a:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (greatest_lower_bound a b) b) b
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP145-1.p.ma b/matita/tests/TPTP/Veloci/GRP145-1.p.ma
index 63b6c5087e7a8c0eca1abc9e03ad9a9ffd7c140c..032cdfd55a72b4cab42112b2ad330e1a3a1f197d 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP145-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP145-1.p.ma
@@ -110,7 +110,7 @@ theorem prove_ax_glb3b:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound (greatest_lower_bound a b) b) (greatest_lower_bound a b)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP146-1.p.ma b/matita/tests/TPTP/Veloci/GRP146-1.p.ma
index 2c39e935df1ac2cb50c67cdf5dfc3a41d7aacb99..6bacee188e163215fa197cd134ba07952073a37f 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP146-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP146-1.p.ma
@@ -115,7 +115,7 @@ theorem prove_ax_lub1a:
 \forall H16:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (least_upper_bound a b) c) c
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP149-1.p.ma b/matita/tests/TPTP/Veloci/GRP149-1.p.ma
index 9030600cb1095a9b282ea081bb57f7577ec54068..e6c7d4ff67303fc64ff0ba1197c844ea0e6525d7 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP149-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP149-1.p.ma
@@ -115,7 +115,7 @@ theorem prove_ax_lub1d:
 \forall H16:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (least_upper_bound a b) c) c
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP150-1.p.ma b/matita/tests/TPTP/Veloci/GRP150-1.p.ma
index ceae0141049d9c0c021e1a61226ba30ab55a0fb3..f612ede8ecea250a5a046439e2e07ddf1ec552cc 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP150-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP150-1.p.ma
@@ -110,7 +110,7 @@ theorem prove_ax_lub2a:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound a (least_upper_bound a b)) (least_upper_bound a b)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP151-1.p.ma b/matita/tests/TPTP/Veloci/GRP151-1.p.ma
index 454c6154687cb9385cd57b92c29e362b2ab4d1dc..240c266b2221ea80ddafcca0637ead9e2a4d63eb 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP151-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP151-1.p.ma
@@ -110,7 +110,7 @@ theorem prove_ax_lub2b:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound a (least_upper_bound a b)) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP152-1.p.ma b/matita/tests/TPTP/Veloci/GRP152-1.p.ma
index 941fc726c9413e911661af6f9d8d89a54fa2bdc7..d9078e5fb2c45b9bd51a7c9ba950d3f732d4d2be 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP152-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP152-1.p.ma
@@ -110,7 +110,7 @@ theorem prove_ax_lub3a:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound b (least_upper_bound a b)) (least_upper_bound a b)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP153-1.p.ma b/matita/tests/TPTP/Veloci/GRP153-1.p.ma
index c677c140c1eed38c85af098ab14e1944f98debb4..7dc86aa7ef45f03952077c29a9350287f826dfa2 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP153-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP153-1.p.ma
@@ -110,7 +110,7 @@ theorem prove_ax_lub3b:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound b (least_upper_bound a b)) b
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP154-1.p.ma b/matita/tests/TPTP/Veloci/GRP154-1.p.ma
index 04245f9de6e3f5645e3fe571e851954704a1d1cb..51832886c01a94fedbb84000d643215f1d64feeb 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP154-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP154-1.p.ma
@@ -114,7 +114,7 @@ theorem prove_ax_mono1a:
 \forall H15:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (multiply a c) (multiply b c)) (multiply b c)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP155-1.p.ma b/matita/tests/TPTP/Veloci/GRP155-1.p.ma
index b7149e55f31790792df7e53ab6d434139cbacb2d..7a940e531e0b4830578f4b57c41ed0e8a2187c12 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP155-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP155-1.p.ma
@@ -112,7 +112,7 @@ theorem prove_ax_mono1b:
 \forall H15:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound (multiply a c) (multiply b c)) (multiply a c)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP156-1.p.ma b/matita/tests/TPTP/Veloci/GRP156-1.p.ma
index db0a9b38f11b5c03b581b55a1500ddef9a1e929e..544290f56f99f5d2fd7e23f93ad2c08805e7472c 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP156-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP156-1.p.ma
@@ -114,7 +114,7 @@ theorem prove_ax_mono1c:
 \forall H15:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound (multiply a c) (multiply b c)) (multiply a c)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP157-1.p.ma b/matita/tests/TPTP/Veloci/GRP157-1.p.ma
index 10948cac5da819da0c63eb65e8d29625b6670fa5..63868e1bf54c2b7bbc1c8ef6dec177ba1b1fd913 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP157-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP157-1.p.ma
@@ -112,7 +112,7 @@ theorem prove_ax_mono2a:
 \forall H15:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (multiply c a) (multiply c b)) (multiply c b)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP158-1.p.ma b/matita/tests/TPTP/Veloci/GRP158-1.p.ma
index 269be40420b01e9157738de1438dc0dc1b5bcd70..710c30a1b619c1dc7aefd655108eb5d1ad35ab7b 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP158-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP158-1.p.ma
@@ -112,7 +112,7 @@ theorem prove_ax_mono2b:
 \forall H15:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound (multiply c a) (multiply c b)) (multiply c a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP159-1.p.ma b/matita/tests/TPTP/Veloci/GRP159-1.p.ma
index 1a9471a66d7d41a51b4c2812a16c2ea9faad094e..ca0b0ffdf36264ac04fe98419d0d6f5bc11874dc 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP159-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP159-1.p.ma
@@ -112,7 +112,7 @@ theorem prove_ax_mono2c:
 \forall H15:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (multiply c a) (multiply c b)) (multiply c b)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP160-1.p.ma b/matita/tests/TPTP/Veloci/GRP160-1.p.ma
index 0aa320f7d637c0add10046425e311cb201c2db7c..1d49bcea17f00ae46601a1b3bc2dffdb3c10a26c 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP160-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP160-1.p.ma
@@ -109,7 +109,7 @@ theorem prove_ax_refla:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound a a) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP161-1.p.ma b/matita/tests/TPTP/Veloci/GRP161-1.p.ma
index 473d47bc4e7fe86b71c0c8799fc5aa11e61a0132..ff4878fbc9ddd3a175a556be941530ffca6b7383 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP161-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP161-1.p.ma
@@ -109,7 +109,7 @@ theorem prove_ax_reflb:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound a a) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP162-1.p.ma b/matita/tests/TPTP/Veloci/GRP162-1.p.ma
index c1af39429208356f0b64e92b2d2c850cd448d43a..4d4fa4e5e67bac00c78391d701399c8cc75294dd 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP162-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP162-1.p.ma
@@ -113,7 +113,7 @@ theorem prove_ax_transa:
 \forall H16:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound a c) c
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP163-1.p.ma b/matita/tests/TPTP/Veloci/GRP163-1.p.ma
index 964662f6cc607ee0e980d26a05a313ec59bb3f8c..3065332b9a173a348f5946c5e60ca75fbb83a3a9 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP163-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP163-1.p.ma
@@ -113,7 +113,7 @@ theorem prove_ax_transb:
 \forall H16:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound a c) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP168-1.p.ma b/matita/tests/TPTP/Veloci/GRP168-1.p.ma
index 162fcd775cc4c4a89594aff60b2cdf4a5350874d..9052578510279c771967a803f93517ef822fc1c0 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP168-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP168-1.p.ma
@@ -116,7 +116,7 @@ theorem prove_p01a:
 \forall H15:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (multiply (inverse c) (multiply a c)) (multiply (inverse c) (multiply b c))) (multiply (inverse c) (multiply b c))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP168-2.p.ma b/matita/tests/TPTP/Veloci/GRP168-2.p.ma
index ff7f0696703ec37e5af526eab87c3ca9605599be..8e669727089db0d0de8e931beda29ce0b0f5388d 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP168-2.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP168-2.p.ma
@@ -114,7 +114,7 @@ theorem prove_p01b:
 \forall H15:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound (multiply (inverse c) (multiply a c)) (multiply (inverse c) (multiply b c))) (multiply (inverse c) (multiply a c))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP173-1.p.ma b/matita/tests/TPTP/Veloci/GRP173-1.p.ma
index 34791231e8b5e95fb23ad4d77da125867cb734cb..d6b61595c16180b60187f126328baae9bf82f82a 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP173-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP173-1.p.ma
@@ -115,7 +115,7 @@ theorem prove_p05a:
 \forall H16:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ identity a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP174-1.p.ma b/matita/tests/TPTP/Veloci/GRP174-1.p.ma
index 77177b3f52acbbba6287e780aed586d55f8d98e0..bd8fecc10099b19cd7c48b4b514b436fb7570dae 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP174-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP174-1.p.ma
@@ -112,7 +112,7 @@ theorem prove_p05b:
 \forall H16:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ identity a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP176-1.p.ma b/matita/tests/TPTP/Veloci/GRP176-1.p.ma
index 485cd7c0e532309081238e625cf1745edc729b60..fe03f9f02a9c9ce2d66cb2be40d8392674467d52 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP176-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP176-1.p.ma
@@ -118,7 +118,7 @@ theorem prove_p07:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (multiply c (multiply (least_upper_bound a b) d)) (least_upper_bound (multiply c (multiply a d)) (multiply c (multiply b d)))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP176-2.p.ma b/matita/tests/TPTP/Veloci/GRP176-2.p.ma
index e5dbe4ab7dd391ce5fb07bd4087b63e1f38048ce..153ac5806b3ea6ff522145b249f182a247ec4d8c 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP176-2.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP176-2.p.ma
@@ -114,7 +114,7 @@ theorem prove_p07:
 \forall H15:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (multiply c (multiply (least_upper_bound a b) d)) (least_upper_bound (multiply c (multiply a d)) (multiply c (multiply b d)))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP182-1.p.ma b/matita/tests/TPTP/Veloci/GRP182-1.p.ma
index 25f4ec89dffcb63263875b0d22ec65058bebdd3a..b2166c28f7ec699a3c981248894bf3a5d016a9bb 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP182-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP182-1.p.ma
@@ -120,7 +120,7 @@ theorem prove_p17a:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound identity (greatest_lower_bound a identity)) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP182-2.p.ma b/matita/tests/TPTP/Veloci/GRP182-2.p.ma
index 99d2f2272ac434d9d3fcfd229def58cf7f65d614..f8955ab0ed8eb1ea590a8cbbd0b1e023f90f6783 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP182-2.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP182-2.p.ma
@@ -121,7 +121,7 @@ theorem prove_p17a:
 \forall H17:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound identity (greatest_lower_bound a identity)) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP182-3.p.ma b/matita/tests/TPTP/Veloci/GRP182-3.p.ma
index ad3388fcf9e4986ac0587cf5206467e45652c453..fa4e6ce2362269c8ae5ae489cd28f40518763452 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP182-3.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP182-3.p.ma
@@ -113,7 +113,7 @@ theorem prove_p17b:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound identity (least_upper_bound a identity)) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP182-4.p.ma b/matita/tests/TPTP/Veloci/GRP182-4.p.ma
index c5f686a70a6639765092f99e02613598761d10c6..95fb312fbd1bc32ddb321496d2689c46b83b642c 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP182-4.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP182-4.p.ma
@@ -114,7 +114,7 @@ theorem prove_p17b:
 \forall H17:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound identity (least_upper_bound a identity)) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP186-3.p.ma b/matita/tests/TPTP/Veloci/GRP186-3.p.ma
index d5ba153b9e44693f97517b7d9ebdffd118267c07..a39543178e52f3f798206eff2060ee645271f086 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP186-3.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP186-3.p.ma
@@ -112,7 +112,7 @@ theorem prove_p23x:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (multiply a b) identity) (multiply a (least_upper_bound (inverse a) b))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP186-4.p.ma b/matita/tests/TPTP/Veloci/GRP186-4.p.ma
index eb035cbbbdb4f577e89a5ecd7a2eea3b7c58e9d3..be8354b19c5f6d98d2ef70d87ed4da712f22ecb7 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP186-4.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP186-4.p.ma
@@ -113,7 +113,7 @@ theorem prove_p23x:
 \forall H17:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (multiply a b) identity) (multiply a (least_upper_bound (inverse a) b))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP188-1.p.ma b/matita/tests/TPTP/Veloci/GRP188-1.p.ma
index 2ad492bcfd7e78b0172545ae0a88293c8147a1b2..da64fdee3b95e9de834eccfe21d9259b71aa1759 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP188-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP188-1.p.ma
@@ -111,7 +111,7 @@ theorem prove_p38a:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound b (least_upper_bound a b)) (least_upper_bound a b)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP188-2.p.ma b/matita/tests/TPTP/Veloci/GRP188-2.p.ma
index 9008f3ef0e1f3b6e368d8800db074638199208bf..771056e01d80958199a32c127fc61cad40930a65 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP188-2.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP188-2.p.ma
@@ -112,7 +112,7 @@ theorem prove_p38a:
 \forall H17:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound b (least_upper_bound a b)) (least_upper_bound a b)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP189-1.p.ma b/matita/tests/TPTP/Veloci/GRP189-1.p.ma
index d2fff5b3d0c31ee1e4b3e30a6d861e10cbc2f2b0..183e7b77225b36a7433eb57b62b642b405fbbb63 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP189-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP189-1.p.ma
@@ -111,7 +111,7 @@ theorem prove_p38b:
 \forall H14:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound b (least_upper_bound a b)) b
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP189-2.p.ma b/matita/tests/TPTP/Veloci/GRP189-2.p.ma
index eedb47810f62fa399a2718d6c16dbbafae2451e5..0b47a1614590c289368f6be62251c33d44cc0f11 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP189-2.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP189-2.p.ma
@@ -112,7 +112,7 @@ theorem prove_p38b:
 \forall H17:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (greatest_lower_bound b (least_upper_bound a b)) b
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP192-1.p.ma b/matita/tests/TPTP/Veloci/GRP192-1.p.ma
index 8463afd62ba1ba9addad67e68bb293c4d830e474..01ca783b00cf42812abe7e2d005c87a56513fab7 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP192-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP192-1.p.ma
@@ -111,7 +111,7 @@ theorem prove_p40a:
 \forall H15:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP206-1.p.ma b/matita/tests/TPTP/Veloci/GRP206-1.p.ma
index bec8aa7f77c5dc75c0be152b9f10adf43519dffa..9c5b5bcce5b2d75149dc2864538aa563ce69558e 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP206-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP206-1.p.ma
@@ -46,7 +46,7 @@ theorem prove_moufang1:
 \forall H8:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (multiply (multiply a (multiply b c)) a) (multiply (multiply a b) (multiply c a))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP454-1.p.ma b/matita/tests/TPTP/Veloci/GRP454-1.p.ma
index a3f949d3ef705d7f7458fe40ff69e45ea0ff8454..257fdd49afea48e40342432a9caa6b346af425a0 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP454-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP454-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity (divide A (divide B (divide (divide (divide A A) A) C)))) C) B.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP455-1.p.ma b/matita/tests/TPTP/Veloci/GRP455-1.p.ma
index c70c4f672750dd4128c375f14a43b75335158e4d..deaa9a2f0dca1d3454b614ea00c6a402049e6cbc 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP455-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP455-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity (divide A (divide B (divide (divide (divide A A) A) C)))) C) B.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP456-1.p.ma b/matita/tests/TPTP/Veloci/GRP456-1.p.ma
index c5b9d8c5d5917ff490df521e318cd3f86928bf74..228a4f3a6df602cc5bf6886f55a919ffb7124139 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP456-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP456-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_3:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity (divide A (divide B (divide (divide (divide A A) A) C)))) C) B.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP457-1.p.ma b/matita/tests/TPTP/Veloci/GRP457-1.p.ma
index 3358805bc9408d96d13d04ecf241914acbba3703..acd2050d2a904e0bb1ec279043393579f75e0da9 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP457-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP457-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide (divide A A) (divide A (divide B (divide (divide identity A) C)))) C) B.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP458-1.p.ma b/matita/tests/TPTP/Veloci/GRP458-1.p.ma
index e297b3b08085b2e8e7929164a4e4d93129fb662c..44091f50eed3ca30e865be7d43f24db7a8a1a99b 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP458-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP458-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide (divide A A) (divide A (divide B (divide (divide identity A) C)))) C) B.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP459-1.p.ma b/matita/tests/TPTP/Veloci/GRP459-1.p.ma
index c3302ae0c486c0cc9fc9ac6adb9c5ec8811bdaa6..303f737416b430251ab9ae9c62f4d1f1bfff405c 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP459-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP459-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_3:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide (divide A A) (divide A (divide B (divide (divide identity A) C)))) C) B.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP460-1.p.ma b/matita/tests/TPTP/Veloci/GRP460-1.p.ma
index 7dcd0f6989a1415adf1a717dc9b02007caf1da18..698ac8a23e83c0ab3ddcaa94ce3e3513234c99e5 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP460-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP460-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide A (divide (divide (divide identity B) C) (divide (divide (divide A A) A) C))) B.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP463-1.p.ma b/matita/tests/TPTP/Veloci/GRP463-1.p.ma
index be1180422cccc0de7950eedccd20b1a7f40f7686..fcd04c0c57f32f71d6eba042a08aa0026aa762c3 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP463-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP463-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide A (divide (divide (divide (divide A A) B) C) (divide (divide identity A) C))) B.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP467-1.p.ma b/matita/tests/TPTP/Veloci/GRP467-1.p.ma
index f7723d3c077c8302ebb01bf192e68b9ccc59992a..1107f4b9821c70df3cfc1f4e2c43e9234e9efac0 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP467-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP467-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_2:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.\forall D:Univ.eq Univ (divide (divide A A) (divide B (divide (divide C (divide D B)) (inverse D)))) C.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP481-1.p.ma b/matita/tests/TPTP/Veloci/GRP481-1.p.ma
index e5f0a50ed172a5ddeaa6cf419504073c277f9634..bf063d591b0396bf2759c4cc470b96d74307884b 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP481-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP481-1.p.ma
@@ -35,7 +35,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.\forall D:Univ.eq Univ (double_divide (double_divide (double_divide A (double_divide B identity)) (double_divide (double_divide C (double_divide D (double_divide D identity))) (double_divide A identity))) B) C.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP484-1.p.ma b/matita/tests/TPTP/Veloci/GRP484-1.p.ma
index 746cf9541c0d7235268b6885246a16702b760200..e8588f917fd2476c2f02a1304940af81c50659eb 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP484-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP484-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide (double_divide A B) C) (double_divide B identity))) (double_divide identity identity)) C.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP485-1.p.ma b/matita/tests/TPTP/Veloci/GRP485-1.p.ma
index 63fe7d2a12eabee90aa036243698335c96299846..2a015e13e298a00889d878f730c17fba098a27de 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP485-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP485-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide (double_divide A B) C) (double_divide B identity))) (double_divide identity identity)) C.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP486-1.p.ma b/matita/tests/TPTP/Veloci/GRP486-1.p.ma
index b8ecfd815755435c70e86a122836eb3265ed5088..ccdaf0ea94de86cedcc01a86050e9c18130fe794 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP486-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP486-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_3:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide (double_divide A B) C) (double_divide B identity))) (double_divide identity identity)) C.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP487-1.p.ma b/matita/tests/TPTP/Veloci/GRP487-1.p.ma
index b679645fe2a0f4f9d80e94ae46509b31615ca989..a26acef170d163a15bde9d45c70c6905375b25a5 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP487-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP487-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide A (double_divide (double_divide (double_divide identity (double_divide (double_divide A identity) (double_divide B C))) B) identity)) C.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP488-1.p.ma b/matita/tests/TPTP/Veloci/GRP488-1.p.ma
index c6b63cbcf0a6b1d9bf111e7129d6fa5403fc0d58..ff1c3c177464a9522acc317abb734706ba1b3774 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP488-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP488-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide A (double_divide (double_divide (double_divide identity (double_divide (double_divide A identity) (double_divide B C))) B) identity)) C.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP490-1.p.ma b/matita/tests/TPTP/Veloci/GRP490-1.p.ma
index 326e725021ab233cbf3388d5ffebd4665e502bce..78e958798bcd81f7298b2db5da3168d632752c32 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP490-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP490-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide identity A) (double_divide identity (double_divide (double_divide (double_divide A B) identity) (double_divide C B)))) C.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP491-1.p.ma b/matita/tests/TPTP/Veloci/GRP491-1.p.ma
index 39482784f94ecb3987af66c7909552c61e34d12f..221fdb592eb4915c7bb53c554120ba8433bb2ffd 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP491-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP491-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide identity A) (double_divide identity (double_divide (double_divide (double_divide A B) identity) (double_divide C B)))) C.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP492-1.p.ma b/matita/tests/TPTP/Veloci/GRP492-1.p.ma
index 3af993fcf64b1b30f5a993687581f9f909af480e..e9f198d2d6d4f3eb77957792ee221df21963a84c 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP492-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP492-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_3:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide identity A) (double_divide identity (double_divide (double_divide (double_divide A B) identity) (double_divide C B)))) C.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP493-1.p.ma b/matita/tests/TPTP/Veloci/GRP493-1.p.ma
index 059f6e300ef901825cf9294323f524d5dbdf7006..fc0bf16ce2f5d46dece2a4f25a239aceb99f19ae 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP493-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP493-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide identity A) (double_divide (double_divide (double_divide B C) (double_divide identity identity)) (double_divide A C))) B.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP494-1.p.ma b/matita/tests/TPTP/Veloci/GRP494-1.p.ma
index 888ad8576dd204c80833d8be96cb25ad4cb4621f..ea863067aee96b4afa6c764073cb37c10f09f1d0 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP494-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP494-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide identity A) (double_divide (double_divide (double_divide B C) (double_divide identity identity)) (double_divide A C))) B.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP495-1.p.ma b/matita/tests/TPTP/Veloci/GRP495-1.p.ma
index 8c6d03b3d3c8a2d80d68da59c78a358362359e84..2250284122c6da5065e6d62d43e4189f4d7b5ee9 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP495-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP495-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_3:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide identity A) (double_divide (double_divide (double_divide B C) (double_divide identity identity)) (double_divide A C))) B.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP496-1.p.ma b/matita/tests/TPTP/Veloci/GRP496-1.p.ma
index f96492e1323cb460407be3b2f65a2743532cacdd..efe2d3a9408f613b1e55159953373cbe4db7e013 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP496-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP496-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide identity (double_divide A (double_divide B identity))) (double_divide (double_divide B (double_divide C A)) identity)) C.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP497-1.p.ma b/matita/tests/TPTP/Veloci/GRP497-1.p.ma
index 79e82ae64824dee08d529b2fdb0a960352f36639..c2f5d7be94bafb159056709557ee608e3a31173b 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP497-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP497-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide identity (double_divide A (double_divide B identity))) (double_divide (double_divide B (double_divide C A)) identity)) C.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP498-1.p.ma b/matita/tests/TPTP/Veloci/GRP498-1.p.ma
index d2cac96d095dde1ceec5a3fd5e3b8d96fdc81b12..c5875b0b29331be67d93c5f8baffd5bb0abdada8 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP498-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP498-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_3:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide identity (double_divide A (double_divide B identity))) (double_divide (double_divide B (double_divide C A)) identity)) C.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP509-1.p.ma b/matita/tests/TPTP/Veloci/GRP509-1.p.ma
index dfbaf1362c1bb08431df81b81ef49e865db60456..25618b46a93eee44c35802aaf1019502d0e9774d 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP509-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP509-1.p.ma
@@ -31,7 +31,7 @@ theorem prove_these_axioms_1:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (multiply (multiply (multiply A B) C) (inverse (multiply A C))) B.eq Univ (multiply (inverse a1) a1) (multiply (inverse b1) b1)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP510-1.p.ma b/matita/tests/TPTP/Veloci/GRP510-1.p.ma
index 7806668c00f452bb83d6ddf688e9f0dffad40564..1003a40145a3c13e004017df92427466aab58aa5 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP510-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP510-1.p.ma
@@ -31,7 +31,7 @@ theorem prove_these_axioms_2:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (multiply (multiply (multiply A B) C) (inverse (multiply A C))) B.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP511-1.p.ma b/matita/tests/TPTP/Veloci/GRP511-1.p.ma
index 34d3bab743d45b47937422ae8818306461c288a1..ff8c9f4c0e4579edf934b262551040a209ac4f82 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP511-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP511-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_3:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (multiply (multiply (multiply A B) C) (inverse (multiply A C))) B.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP512-1.p.ma b/matita/tests/TPTP/Veloci/GRP512-1.p.ma
index 790814570ef377da7c921589977228887820594f..19a8c4a941df0b21e2ad301577b899b84a9908ff 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP512-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP512-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_4:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (multiply (multiply (multiply A B) C) (inverse (multiply A C))) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP513-1.p.ma b/matita/tests/TPTP/Veloci/GRP513-1.p.ma
index 0228172975cacf3c5d0c54c1ef258dc640c48f40..03409c949d3f0c7e59647313f1237fc59ab4c5c3 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP513-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP513-1.p.ma
@@ -30,7 +30,7 @@ theorem prove_these_axioms_1:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (multiply A (multiply (multiply B C) (inverse (multiply A C)))) B.eq Univ (multiply (inverse a1) a1) (multiply (inverse b1) b1)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP514-1.p.ma b/matita/tests/TPTP/Veloci/GRP514-1.p.ma
index 44411f118e6ac4fa0b8c7052e138376c558ba645..90593b6c873ffc34e92e343cbc7ae5286900f9f9 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP514-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP514-1.p.ma
@@ -30,7 +30,7 @@ theorem prove_these_axioms_2:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (multiply A (multiply (multiply B C) (inverse (multiply A C)))) B.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP515-1.p.ma b/matita/tests/TPTP/Veloci/GRP515-1.p.ma
index 2ad540b74a9f876e270b5792bdaf4eeeffdbaed0..7b526ef973e5f3b81aa1207cfd24b68ddc017c99 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP515-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP515-1.p.ma
@@ -31,7 +31,7 @@ theorem prove_these_axioms_3:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (multiply A (multiply (multiply B C) (inverse (multiply A C)))) B.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP516-1.p.ma b/matita/tests/TPTP/Veloci/GRP516-1.p.ma
index 59a8da6ac7efdbe48ecbdab1bdbffb5cf4a552cd..af15eb7eefb9a3580a611f512e5f8e87946d2ee8 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP516-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP516-1.p.ma
@@ -31,7 +31,7 @@ theorem prove_these_axioms_4:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (multiply A (multiply (multiply B C) (inverse (multiply A C)))) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP517-1.p.ma b/matita/tests/TPTP/Veloci/GRP517-1.p.ma
index e268d2534e0b5a087409f015648c196d603ac05d..a488717cd115d90f574f0c9571f4123d68808be7 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP517-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP517-1.p.ma
@@ -30,7 +30,7 @@ theorem prove_these_axioms_1:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (multiply A (multiply (multiply (inverse (multiply A B)) C) B)) C.eq Univ (multiply (inverse a1) a1) (multiply (inverse b1) b1)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP518-1.p.ma b/matita/tests/TPTP/Veloci/GRP518-1.p.ma
index 89a742ca10f22f9b2f123dbf01fce9d0b8723376..a953ab61084cd3d27549f791cc31461e6b56097e 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP518-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP518-1.p.ma
@@ -30,7 +30,7 @@ theorem prove_these_axioms_2:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (multiply A (multiply (multiply (inverse (multiply A B)) C) B)) C.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP520-1.p.ma b/matita/tests/TPTP/Veloci/GRP520-1.p.ma
index 879b8f0a9112a786119a34d99fe24b0ae05e2291..ea992df719e8a4763676fd3cb90236defc73c3cb 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP520-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP520-1.p.ma
@@ -31,7 +31,7 @@ theorem prove_these_axioms_4:
 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (multiply A (multiply (multiply (inverse (multiply A B)) C) B)) C.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP541-1.p.ma b/matita/tests/TPTP/Veloci/GRP541-1.p.ma
index 446167f51702bb90033cb15b27d4ec3c9efd11a5..a8f428a0d9511f1474422cb83b43314b5a2c8354 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP541-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP541-1.p.ma
@@ -35,7 +35,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity (divide (divide (divide A B) C) A)) C) B.eq Univ (multiply (inverse a1) a1) (multiply (inverse b1) b1)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP542-1.p.ma b/matita/tests/TPTP/Veloci/GRP542-1.p.ma
index 6e084eef48c4c3c846c9730d22120e877a6ac7ec..848748d87b74bbbfb74fcfb72b1d91b686d913d1 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP542-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP542-1.p.ma
@@ -35,7 +35,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity (divide (divide (divide A B) C) A)) C) B.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP543-1.p.ma b/matita/tests/TPTP/Veloci/GRP543-1.p.ma
index 2e80e0158a1757d8f080bf22ca1578357dea2256..cfc5bab5801013f8e5e872195828b7fd7e77852b 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP543-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP543-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_3:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity (divide (divide (divide A B) C) A)) C) B.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP544-1.p.ma b/matita/tests/TPTP/Veloci/GRP544-1.p.ma
index 3a5257ed0861d394eeb918d7ae6fc83c5a61773c..96fb69f734cd6a8a91562390aeda9fc3952f096a 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP544-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP544-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_4:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity (divide (divide (divide A B) C) A)) C) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP545-1.p.ma b/matita/tests/TPTP/Veloci/GRP545-1.p.ma
index e4caec04b8e504ad744817fee1182ff64d41a0e9..302fb8916d903b539b31b37d4a4a7c72c74a5aef 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP545-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP545-1.p.ma
@@ -35,7 +35,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity (divide A B)) (divide (divide B C) A)) C.eq Univ (multiply (inverse a1) a1) (multiply (inverse b1) b1)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP546-1.p.ma b/matita/tests/TPTP/Veloci/GRP546-1.p.ma
index ba46f7f716c80732cddb05e1fe1c750dc72bb959..2488a948412589b6e143b5f5415fe10db8cbcbbf 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP546-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP546-1.p.ma
@@ -35,7 +35,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity (divide A B)) (divide (divide B C) A)) C.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP547-1.p.ma b/matita/tests/TPTP/Veloci/GRP547-1.p.ma
index 981df2d128d13a3ea5964acfd388126671eb80e8..24ede0fe7ff0438330fc15f6bb5fdc3824b2fa6a 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP547-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP547-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_3:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity (divide A B)) (divide (divide B C) A)) C.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP548-1.p.ma b/matita/tests/TPTP/Veloci/GRP548-1.p.ma
index 8750ac7e8b0a55b641ecff9e22f97608272b6098..a065d3f1b804dad10c9fc141d2cc2e595883354d 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP548-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP548-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_4:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity (divide A B)) (divide (divide B C) A)) C.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP549-1.p.ma b/matita/tests/TPTP/Veloci/GRP549-1.p.ma
index 9e5165b72a604c50f782294c8061951339b07cc2..0bf4dbf1cc3b0a4c6528821dfd4b3d8381c6a3b4 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP549-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP549-1.p.ma
@@ -35,7 +35,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity A) (divide (divide (divide B A) C) B)) C.eq Univ (multiply (inverse a1) a1) (multiply (inverse b1) b1)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP550-1.p.ma b/matita/tests/TPTP/Veloci/GRP550-1.p.ma
index ceb1fcb92843ca028592a3d0eb7811e77cf1d8c9..a7482f9b5dc12d238c4ed05e63c22ec51c3c8e43 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP550-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP550-1.p.ma
@@ -35,7 +35,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity A) (divide (divide (divide B A) C) B)) C.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP551-1.p.ma b/matita/tests/TPTP/Veloci/GRP551-1.p.ma
index 69b83f64d9405685dbc778654be7cb5017dadcaf..3144369c251d78fe74ecf6206dc16b3332e65bde 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP551-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP551-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_3:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity A) (divide (divide (divide B A) C) B)) C.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP552-1.p.ma b/matita/tests/TPTP/Veloci/GRP552-1.p.ma
index 72d8dbb1ac034540e7b12a27cc5898fc344c9124..9a776c962096f2e71e1a87a672eac5f5ee6823af 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP552-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP552-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_4:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide identity A) (divide (divide (divide B A) C) B)) C.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP556-1.p.ma b/matita/tests/TPTP/Veloci/GRP556-1.p.ma
index 7ff2cf4fc9383ebc325d885c747a5ff7ff9551b5..f314261a2e57971470b3a3abed43e34c58ddee08 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP556-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP556-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_4:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide A (inverse (divide B (divide A C)))) C) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP558-1.p.ma b/matita/tests/TPTP/Veloci/GRP558-1.p.ma
index d3ffe8859e78ba4626e0cbe69ca6b5ea1a8c91e3..35670d9cbe46058c770f9c94fce902aab717fe7c 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP558-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP558-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_2:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide A (inverse (divide (divide B C) (divide A C)))) B.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP560-1.p.ma b/matita/tests/TPTP/Veloci/GRP560-1.p.ma
index f145a3af95a32589f88dc493ad2f996621b17d6e..113f49edf4d29691493d17424f3050bc7b9ec931 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP560-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP560-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_4:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide A (inverse (divide (divide B C) (divide A C)))) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP561-1.p.ma b/matita/tests/TPTP/Veloci/GRP561-1.p.ma
index d6d1ef6ed7e4bdcc188bb0454172dd562a00b5a0..dc788b10944eabd593f86534bc8ab78e425ad950 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP561-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP561-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_1:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide (divide A (inverse B)) C) (divide A C)) B.eq Univ (multiply (inverse a1) a1) (multiply (inverse b1) b1)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP562-1.p.ma b/matita/tests/TPTP/Veloci/GRP562-1.p.ma
index 118adfa7a770288b5faf3632d107c9ab88a9d7f8..99ea92789459bb44be50b2801b88e1e099094b6c 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP562-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP562-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_2:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide (divide A (inverse B)) C) (divide A C)) B.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP564-1.p.ma b/matita/tests/TPTP/Veloci/GRP564-1.p.ma
index c46fb73d6c217c20d14eb1bc4abc812ca0892073..63b1c2d979032cfb069de5286cbec86e4d215efc 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP564-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP564-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_4:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (divide (divide (divide A (inverse B)) C) (divide A C)) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP565-1.p.ma b/matita/tests/TPTP/Veloci/GRP565-1.p.ma
index e9151448c31fd25e05eef1f0c3d0c37d61195cbb..ad4f9357093493aed2771b7e7c8b68dc1091eca2 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP565-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP565-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide B (double_divide A C)) (double_divide identity C))) (double_divide identity identity)) B.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP566-1.p.ma b/matita/tests/TPTP/Veloci/GRP566-1.p.ma
index 23b805f007ef413fff59a1e77f63ce3f29a02a83..71a827e476ab6a9b677133ff0ca3864e91dad451 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP566-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP566-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide B (double_divide A C)) (double_divide identity C))) (double_divide identity identity)) B.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP567-1.p.ma b/matita/tests/TPTP/Veloci/GRP567-1.p.ma
index e77e2b7620aef78c5b4225015fc61967dba54dd3..6fbd3492bfad64bc897c05da603f9ef59b8b204e 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP567-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP567-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_3:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide B (double_divide A C)) (double_divide identity C))) (double_divide identity identity)) B.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP568-1.p.ma b/matita/tests/TPTP/Veloci/GRP568-1.p.ma
index 07adcfd9b2c0bae5ad15162e3f7d046a5f51afb1..884ed5e5c4d679473bb789666568f2ef6610feb6 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP568-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP568-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_4:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide B (double_divide A C)) (double_divide identity C))) (double_divide identity identity)) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP569-1.p.ma b/matita/tests/TPTP/Veloci/GRP569-1.p.ma
index 260522c0536d33ae2e5bbd488141847d90c5e98d..931c933ba26b1d422801c70355af5a5efc01684d 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP569-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP569-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide B (double_divide A C)) (double_divide C identity))) (double_divide identity identity)) B.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP570-1.p.ma b/matita/tests/TPTP/Veloci/GRP570-1.p.ma
index d74cd154f12d300456a5f7e6644a8fed437feb78..d6bdbbfc691d194fadace23645d5b05293e1f00a 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP570-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP570-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide B (double_divide A C)) (double_divide C identity))) (double_divide identity identity)) B.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP572-1.p.ma b/matita/tests/TPTP/Veloci/GRP572-1.p.ma
index 270768037c78bbe72df1dcbb2db4acb841f8f007..c3e517cefbd197c7de2b835b68d62a8b8ed3456d 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP572-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP572-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_4:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide B (double_divide A C)) (double_divide C identity))) (double_divide identity identity)) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP573-1.p.ma b/matita/tests/TPTP/Veloci/GRP573-1.p.ma
index 1ae737d5bf7484be68eec50fcb71d41f6636003f..8076345ccdf59c505c32f647c0880c3930d1e532 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP573-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP573-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide B (double_divide C A)) (double_divide C identity))) (double_divide identity identity)) B.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP574-1.p.ma b/matita/tests/TPTP/Veloci/GRP574-1.p.ma
index a3d3395f5b525479bed478a4d11371749aaf5238..e6f9dfceca70205e76128215aed3e8580b529d2b 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP574-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP574-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide B (double_divide C A)) (double_divide C identity))) (double_divide identity identity)) B.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP576-1.p.ma b/matita/tests/TPTP/Veloci/GRP576-1.p.ma
index d192c04554f4c1a0b35899e238226da003a7ec9e..aed52d2deff691f0607d00d2915d021b1dc76159 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP576-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP576-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_4:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide B (double_divide C A)) (double_divide C identity))) (double_divide identity identity)) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP577-1.p.ma b/matita/tests/TPTP/Veloci/GRP577-1.p.ma
index e0836fded57745e7bcfbebf624b935920c3e5267..ad7c58b9ef74944a31ab478371cea224260a27fe 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP577-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP577-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide (double_divide B A) C) (double_divide B identity))) (double_divide identity identity)) C.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP578-1.p.ma b/matita/tests/TPTP/Veloci/GRP578-1.p.ma
index ef7d1793f9d28bedb76a0f5d682963668724fc02..7c9843da7b16ecf70fd8713d613d854abb7a450d 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP578-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP578-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide (double_divide B A) C) (double_divide B identity))) (double_divide identity identity)) C.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP580-1.p.ma b/matita/tests/TPTP/Veloci/GRP580-1.p.ma
index aee50acd9f383533039ba2ad73831f077e043f7a..4d729b9959fb46660f288775f6f43a662d2a0df6 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP580-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP580-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_4:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide (double_divide B A) C) (double_divide B identity))) (double_divide identity identity)) C.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP581-1.p.ma b/matita/tests/TPTP/Veloci/GRP581-1.p.ma
index 76b98c5a29040b22e690a8bb84e1b2511d8867fa..d826e2af1d83f281ec55d064b05c905322c47c83 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP581-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP581-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_1:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide identity B) (double_divide C (double_divide B A)))) (double_divide identity identity)) C.eq Univ (multiply (inverse a1) a1) identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP582-1.p.ma b/matita/tests/TPTP/Veloci/GRP582-1.p.ma
index 2c1a81a7d9776e7b13018ae096e1d6e046201ed8..4c09bb39cf6e736cb075a3919a9fbdf68462b97b 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP582-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP582-1.p.ma
@@ -34,7 +34,7 @@ theorem prove_these_axioms_2:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide identity B) (double_divide C (double_divide B A)))) (double_divide identity identity)) C.eq Univ (multiply identity a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP583-1.p.ma b/matita/tests/TPTP/Veloci/GRP583-1.p.ma
index eb1c927ecebc608f56a77553ef6259413779a422..fa95c336a80f5b7c8359466f7996cc76e15ffd44 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP583-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP583-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_3:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide identity B) (double_divide C (double_divide B A)))) (double_divide identity identity)) C.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP584-1.p.ma b/matita/tests/TPTP/Veloci/GRP584-1.p.ma
index b66e93f4326c5ac1bb39a30b55e0620de36a973b..db36e336b84676a2c20f50f2df4c85507b010763 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP584-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP584-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_these_axioms_4:
 \forall H3:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A (double_divide (double_divide identity B) (double_divide C (double_divide B A)))) (double_divide identity identity)) C.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP586-1.p.ma b/matita/tests/TPTP/Veloci/GRP586-1.p.ma
index 9c4c69ed04e6c21b2f965b155eab93fedb30ffac..f38467e27043c6de739f3f8b0b6ff33f01eb35a8 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP586-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP586-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_2:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide A (inverse (double_divide (inverse (double_divide (double_divide A B) (inverse C))) B))) C.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP588-1.p.ma b/matita/tests/TPTP/Veloci/GRP588-1.p.ma
index 1c32572b03639601d6187d0d7af774c9574e6712..1d13edfbe9160694d7a313671f7bd03b1a1f441b 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP588-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP588-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_4:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide A (inverse (double_divide (inverse (double_divide (double_divide A B) (inverse C))) B))) C.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP590-1.p.ma b/matita/tests/TPTP/Veloci/GRP590-1.p.ma
index 3a8c3f1323da3d19638f2aeaccb768d769f7f973..f678b3d830363e730aa907d7703383bd02b8f595 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP590-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP590-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_2:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (inverse (double_divide (double_divide A B) (inverse (double_divide A (inverse C))))) B) C.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP592-1.p.ma b/matita/tests/TPTP/Veloci/GRP592-1.p.ma
index c2c748817dc6a0a91900a4c3e295f94fcd124baf..5612e2720278d31c1067edca23297ce56bb0d68b 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP592-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP592-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_4:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (inverse (double_divide (double_divide A B) (inverse (double_divide A (inverse C))))) B) C.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP595-1.p.ma b/matita/tests/TPTP/Veloci/GRP595-1.p.ma
index d17416172d31725d31a5890b577058ac808bda13..e97f64cd3e8809e2334229d7412393a6f8d164ba 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP595-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP595-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_3:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (inverse (double_divide (double_divide A B) (inverse (double_divide A (inverse (double_divide C B)))))) C.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP596-1.p.ma b/matita/tests/TPTP/Veloci/GRP596-1.p.ma
index 45b171485926b697e088a209829ad9f6726ef17f..1d8e313ac925873c7918ce4072cd55faa30043d9 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP596-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP596-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_4:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (inverse (double_divide (double_divide A B) (inverse (double_divide A (inverse (double_divide C B)))))) C.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP597-1.p.ma b/matita/tests/TPTP/Veloci/GRP597-1.p.ma
index 3076cda7d3021200388fff7f9607a24038fe0dd3..5923b8e70ab913172f115a1c5278c5f2109bf964 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP597-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP597-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_1:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A B) (inverse (double_divide A (inverse (double_divide (inverse C) B))))) C.eq Univ (multiply (inverse a1) a1) (multiply (inverse b1) b1)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP598-1.p.ma b/matita/tests/TPTP/Veloci/GRP598-1.p.ma
index dfd96656205e4ae78fc81f33d65596c032509da1..133ed30f63d014e2506518f9171b866fe6044706 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP598-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP598-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_2:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A B) (inverse (double_divide A (inverse (double_divide (inverse C) B))))) C.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP599-1.p.ma b/matita/tests/TPTP/Veloci/GRP599-1.p.ma
index f703d7b6ba6c3e13099102ec6fa6d852cdcb29b3..31716a7106216f2c8acf5dfe9e7dedeb983576a6 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP599-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP599-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_3:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A B) (inverse (double_divide A (inverse (double_divide (inverse C) B))))) C.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP600-1.p.ma b/matita/tests/TPTP/Veloci/GRP600-1.p.ma
index d8180ca64c32b13a19d155eefe9112601a180986..07535f9bbcd2a39dcf436062bfa61112c43e6d54 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP600-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP600-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_4:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (double_divide A B) (inverse (double_divide A (inverse (double_divide (inverse C) B))))) C.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP602-1.p.ma b/matita/tests/TPTP/Veloci/GRP602-1.p.ma
index d2d0d3305ee7b09099836b7dc9aa29402a7ed1f6..620ddb94e4a3414d163c91e8a3ec1903525f524b 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP602-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP602-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_2:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (inverse (double_divide (inverse (double_divide A (inverse (double_divide B (double_divide A C))))) C)) B.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP603-1.p.ma b/matita/tests/TPTP/Veloci/GRP603-1.p.ma
index 6ee5d33c5538dbb0130e67eac25c6cf7fcc247c3..6d7b92f84fdcd3006a45fc79e40a580bc0e79569 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP603-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP603-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_3:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (inverse (double_divide (inverse (double_divide A (inverse (double_divide B (double_divide A C))))) C)) B.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP604-1.p.ma b/matita/tests/TPTP/Veloci/GRP604-1.p.ma
index 4e083dea9edd95f2d15c759c7ab6633afcae4ae3..9e228851ded02b766e412afcd9f76365a4a86c03 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP604-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP604-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_4:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (inverse (double_divide (inverse (double_divide A (inverse (double_divide B (double_divide A C))))) C)) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP605-1.p.ma b/matita/tests/TPTP/Veloci/GRP605-1.p.ma
index 0145a313e9ce45ec47d93689af586fb30ba3bd62..89084a07beb71b2d8f6a82ff483416ff8f2d1565 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP605-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP605-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_1:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (inverse (double_divide A (inverse (double_divide (inverse B) (double_divide A C))))) C) B.eq Univ (multiply (inverse a1) a1) (multiply (inverse b1) b1)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP606-1.p.ma b/matita/tests/TPTP/Veloci/GRP606-1.p.ma
index 4f4e2bea1150ab554ca4faac99c0ad2f46acb029..09742e1ac609235fd574974ac9695594a6fc9b47 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP606-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP606-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_2:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (inverse (double_divide A (inverse (double_divide (inverse B) (double_divide A C))))) C) B.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP608-1.p.ma b/matita/tests/TPTP/Veloci/GRP608-1.p.ma
index 811ae06bcf0b1c95b88ca9d86f1f1c4e41eb3cf9..de594533178c473b3ae58007c71d1a950f988525 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP608-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP608-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_4:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (inverse (double_divide A (inverse (double_divide (inverse B) (double_divide A C))))) C) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP612-1.p.ma b/matita/tests/TPTP/Veloci/GRP612-1.p.ma
index 936eedbaa22130ff2f7a62707376a7f5a063ce53..3dec2670853abe8263e087c22437f310afac68a7 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP612-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP612-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_4:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (inverse (double_divide (inverse (double_divide (inverse (double_divide A B)) C)) (double_divide A C))) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP613-1.p.ma b/matita/tests/TPTP/Veloci/GRP613-1.p.ma
index 5f5960ed6530ac0da48fb49e719bc62d83ba2643..206e1edcbaf6acdbffcb3f01d5d5a5ffb9ece516 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP613-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP613-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_1:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (inverse (double_divide (inverse (double_divide A (inverse B))) C)) (double_divide A C)) B.eq Univ (multiply (inverse a1) a1) (multiply (inverse b1) b1)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP614-1.p.ma b/matita/tests/TPTP/Veloci/GRP614-1.p.ma
index 389785f55b9bc36056a5e327dc0bb9d1f5f6d96a..203d3f2166065fc83e3599b2fc4847f529713dc7 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP614-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP614-1.p.ma
@@ -32,7 +32,7 @@ theorem prove_these_axioms_2:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (inverse (double_divide (inverse (double_divide A (inverse B))) C)) (double_divide A C)) B.eq Univ (multiply (multiply (inverse b2) b2) a2) a2
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP615-1.p.ma b/matita/tests/TPTP/Veloci/GRP615-1.p.ma
index 2f656b223e38a8d7ee8b6c8ef230d92f6a838c1a..2fe6234f6b42ec75543d5ffc39ab93851e77d9a6 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP615-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP615-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_3:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (inverse (double_divide (inverse (double_divide A (inverse B))) C)) (double_divide A C)) B.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/GRP616-1.p.ma b/matita/tests/TPTP/Veloci/GRP616-1.p.ma
index 619a0f5bba45a9613322910e2ea806758817ec4f..6649a53d8d965d20d3d044dd6cb63539d0a7d694 100644 (file)
--- a/matita/tests/TPTP/Veloci/GRP616-1.p.ma
+++ b/matita/tests/TPTP/Veloci/GRP616-1.p.ma
@@ -33,7 +33,7 @@ theorem prove_these_axioms_4:
 \forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (inverse (double_divide (inverse (double_divide A (inverse B))) C)) (double_divide A C)) B.eq Univ (multiply a b) (multiply b a)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LAT008-1.p.ma b/matita/tests/TPTP/Veloci/LAT008-1.p.ma
index 789549d1ceff5eb49dafede47b78616242476de9..a8ee942e6d1af2b1b2947ee650ddf37fe703fef3 100644 (file)
--- a/matita/tests/TPTP/Veloci/LAT008-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LAT008-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_absorbtion_dual:
 \forall H1:\forall X:Univ.\forall Y:Univ.eq Univ (meet X (join X Y)) X.eq Univ (join a (meet a b)) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LAT033-1.p.ma b/matita/tests/TPTP/Veloci/LAT033-1.p.ma
index b5548d960ccbee5befeae577895a2ec13e11dd13..e1897a41435396c3dc46fea518aed9f8a05c190a 100644 (file)
--- a/matita/tests/TPTP/Veloci/LAT033-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LAT033-1.p.ma
@@ -39,7 +39,7 @@ theorem idempotence_of_join:
 \forall H5:\forall X:Univ.\forall Y:Univ.eq Univ (meet X (join X Y)) X.eq Univ (join xx xx) xx
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LAT034-1.p.ma b/matita/tests/TPTP/Veloci/LAT034-1.p.ma
index 801451c4332c97508d0ffcd0f39f380f562e9993..37ce834ab1c68f10e6b376950ca2316ee86dc2ab 100644 (file)
--- a/matita/tests/TPTP/Veloci/LAT034-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LAT034-1.p.ma
@@ -39,7 +39,7 @@ theorem idempotence_of_meet:
 \forall H5:\forall X:Univ.\forall Y:Univ.eq Univ (meet X (join X Y)) X.eq Univ (meet xx xx) xx
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LAT039-1.p.ma b/matita/tests/TPTP/Veloci/LAT039-1.p.ma
index 61d6cef0429f814f2791def4f22947bac8efa2db..8ad8654fc717ce6f87aaea8e44c164b1b5042a56 100644 (file)
--- a/matita/tests/TPTP/Veloci/LAT039-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LAT039-1.p.ma
@@ -70,7 +70,7 @@ theorem rhs:
 \forall H10:\forall X:Univ.eq Univ (meet X X) X.eq Univ (join xx (meet yy zz)) (meet yy (join xx zz))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LAT039-2.p.ma b/matita/tests/TPTP/Veloci/LAT039-2.p.ma
index c7af583bd8e7957e37ae4df2fb3394e5f6047227..de4e55ffae76ac530f2700d507b73d564554e794 100644 (file)
--- a/matita/tests/TPTP/Veloci/LAT039-2.p.ma
+++ b/matita/tests/TPTP/Veloci/LAT039-2.p.ma
@@ -69,7 +69,7 @@ theorem rhs:
 \forall H10:\forall X:Univ.eq Univ (meet X X) X.eq Univ (join xx (meet yy zz)) (meet (join xx yy) (join xx zz))
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LAT040-1.p.ma b/matita/tests/TPTP/Veloci/LAT040-1.p.ma
index 9982a8eab832137c907583f0ff0814d451a318f9..a4ff6eff60d4c37686ae5dcc796bcae6dba6096c 100644 (file)
--- a/matita/tests/TPTP/Veloci/LAT040-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LAT040-1.p.ma
@@ -70,7 +70,7 @@ theorem rhs:
 \forall H11:\forall X:Univ.eq Univ (meet X X) X.eq Univ yy zz
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LAT045-1.p.ma b/matita/tests/TPTP/Veloci/LAT045-1.p.ma
index f998f72e92809091ceb9f1391bb87a0bf53d9e45..0b58207dbdd38c934b5e6b627038a5ee7464c225 100644 (file)
--- a/matita/tests/TPTP/Veloci/LAT045-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LAT045-1.p.ma
@@ -77,7 +77,7 @@ theorem prove_orthomodular_law:
 \forall H13:\forall X:Univ.eq Univ (meet X X) X.eq Univ (join a (meet (complement a) (join a b))) (join a b)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL110-2.p.ma b/matita/tests/TPTP/Veloci/LCL110-2.p.ma
index 9515feec6f45bae1cf3c41eb84ebd35c937050b2..442ce5958c2081068327a6446c9877dfa17983d1 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL110-2.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL110-2.p.ma
@@ -64,7 +64,7 @@ theorem prove_mv_24:
 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (implies (not (not x)) x) truth
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL112-2.p.ma b/matita/tests/TPTP/Veloci/LCL112-2.p.ma
index ef68697fe81bf8ffd739af13e88738eb3e54860b..473cf328cb21ad039b995f0ccf7119b65c5a7e2d 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL112-2.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL112-2.p.ma
@@ -65,7 +65,7 @@ theorem prove_mv_29:
 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (implies x (not (not x))) truth
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL113-2.p.ma b/matita/tests/TPTP/Veloci/LCL113-2.p.ma
index 534c7fb7e58f35103fee19c3bb08d2ff973fd5ea..c310916a76c01a240e2261ded209bedcc557c9ef 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL113-2.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL113-2.p.ma
@@ -64,7 +64,7 @@ theorem prove_mv_33:
 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (implies (implies (not x) y) (implies (not y) x)) truth
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL114-2.p.ma b/matita/tests/TPTP/Veloci/LCL114-2.p.ma
index 2fce65768ef1a4c4ae63e53cacdf145ab04ee9b7..46cc017276996c1b9cd2b4c57a7892fad4b19e72 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL114-2.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL114-2.p.ma
@@ -65,7 +65,7 @@ theorem prove_mv_36:
 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (implies (implies x y) (implies (not y) (not x))) truth
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL115-2.p.ma b/matita/tests/TPTP/Veloci/LCL115-2.p.ma
index 934852d6e823158b83c04e888c2e2bf578c5de9a..158fef7e81822d0f5b779201eab45cb8653a6bcf 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL115-2.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL115-2.p.ma
@@ -64,7 +64,7 @@ theorem prove_mv_39:
 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (implies (not (implies a b)) (not b)) truth
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL132-1.p.ma b/matita/tests/TPTP/Veloci/LCL132-1.p.ma
index f13905176908ca35b1b84d380772dfef8de6d3d1..330e40369e7e31182e1b7a6a9cd379db8d414fd8 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL132-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL132-1.p.ma
@@ -59,7 +59,7 @@ theorem prove_wajsberg_lemma:
 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (implies x x) truth
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL133-1.p.ma b/matita/tests/TPTP/Veloci/LCL133-1.p.ma
index 48138a19a4214fe4efa9c74cd315e2bbce5ccc42..acd9538be093d461513d0b2582ef01a6e1c63214 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL133-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL133-1.p.ma
@@ -61,7 +61,7 @@ theorem prove_wajsberg_lemma:
 \forall H4:\forall X:Univ.eq Univ (implies truth X) X.eq Univ x y
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL134-1.p.ma b/matita/tests/TPTP/Veloci/LCL134-1.p.ma
index 96e607cea1befd994dfa4ff682c67a800ea29842..d400f7cff02b6c466533df438e58934ff1fb2069 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL134-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL134-1.p.ma
@@ -59,7 +59,7 @@ theorem prove_wajsberg_lemma:
 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (implies x truth) truth
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL135-1.p.ma b/matita/tests/TPTP/Veloci/LCL135-1.p.ma
index 1534861ebfdb9db73a92f70571a73543ad680470..9a982d8afe4fc54e1e2f452ca1bc1eb05ee66b51 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL135-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL135-1.p.ma
@@ -64,7 +64,7 @@ theorem prove_wajsberg_lemma:
 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (implies x (implies y x)) truth
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL139-1.p.ma b/matita/tests/TPTP/Veloci/LCL139-1.p.ma
index c05658d20d7a83bcb56bff25cc89778edd540e12..21a30112899b2d43fafc28b03649276bdbca5356 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL139-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL139-1.p.ma
@@ -59,7 +59,7 @@ theorem prove_wajsberg_lemma:
 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (implies x (not truth)) (not x)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL140-1.p.ma b/matita/tests/TPTP/Veloci/LCL140-1.p.ma
index a134410a2e4a92c7808f7a1e0d8b207e2ede5209..c5148d2a89c539074778a5a8632bca4e4ca37873 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL140-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL140-1.p.ma
@@ -59,7 +59,7 @@ theorem prove_wajsberg_lemma:
 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (not (not x)) x
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL141-1.p.ma b/matita/tests/TPTP/Veloci/LCL141-1.p.ma
index e70a70c3bc0e0f97074a3b6984cd2bb6c03bd266..5f816e92692e4158fdad565b0c2e72c7dd3683dc 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL141-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL141-1.p.ma
@@ -64,7 +64,7 @@ theorem prove_wajsberg_lemma:
 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (implies (not x) (not y)) (implies y x)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL153-1.p.ma b/matita/tests/TPTP/Veloci/LCL153-1.p.ma
index 3919360134358eb64da826bbaddb517f55c7305b..827b9921411e81145ae4d7eee46bffc9fc4b700b 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL153-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL153-1.p.ma
@@ -129,7 +129,7 @@ theorem prove_alternative_wajsberg_axiom:
 \forall H15:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (not x) (xor x truth)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL154-1.p.ma b/matita/tests/TPTP/Veloci/LCL154-1.p.ma
index 4c0c98507b8d77d67f93de008738d3f8a9595809..169be886a6b28dcf6ee7bc9cc8538fe415dc07c4 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL154-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL154-1.p.ma
@@ -129,7 +129,7 @@ theorem prove_alternative_wajsberg_axiom:
 \forall H15:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (xor x falsehood) x
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL155-1.p.ma b/matita/tests/TPTP/Veloci/LCL155-1.p.ma
index 71ed352dd6bc4d209d89cf2ed12bce8647411fc1..d5cb7fb5e1252102536e08ab0f66745abd66d520 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL155-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL155-1.p.ma
@@ -129,7 +129,7 @@ theorem prove_alternative_wajsberg_axiom:
 \forall H15:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (xor x x) falsehood
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL156-1.p.ma b/matita/tests/TPTP/Veloci/LCL156-1.p.ma
index c01872fb9b5b311518d2e314dcc0041026d7f81d..3d5df92b67cef1e9eea39b1efe8d2aa5ce069447 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL156-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL156-1.p.ma
@@ -129,7 +129,7 @@ theorem prove_alternative_wajsberg_axiom:
 \forall H15:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (and_star x truth) x
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL157-1.p.ma b/matita/tests/TPTP/Veloci/LCL157-1.p.ma
index e336e3a3a58031c2f64f7742334660bf942e51b6..97ea2cad985cddad03cfedfe12d927e4c6f52090 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL157-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL157-1.p.ma
@@ -129,7 +129,7 @@ theorem prove_alternative_wajsberg_axiom:
 \forall H15:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (and_star x falsehood) falsehood
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL158-1.p.ma b/matita/tests/TPTP/Veloci/LCL158-1.p.ma
index ed138bd52de7f2fa39d75f9a3d1b5863ccf476e6..32a4518b7e05c8abadb83365f416460805680dd0 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL158-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL158-1.p.ma
@@ -129,7 +129,7 @@ theorem prove_alternative_wajsberg_axiom:
 \forall H15:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (and_star (xor truth x) x) falsehood
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL161-1.p.ma b/matita/tests/TPTP/Veloci/LCL161-1.p.ma
index 57fb55ec71b1699cec89372eb5486a6f471d92c8..3961b05d89597cfd271325a27ca06d9c049c7914 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL161-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL161-1.p.ma
@@ -78,7 +78,7 @@ theorem prove_wajsberg_axiom:
 \forall H12:\forall X:Univ.eq Univ (not X) (xor X truth).eq Univ (implies truth x) x
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LCL164-1.p.ma b/matita/tests/TPTP/Veloci/LCL164-1.p.ma
index a84605051ca7819dbb30bdec5d0b698e4655a86f..8850280e9b06540dc304dbba6ff021d0e6c01314 100644 (file)
--- a/matita/tests/TPTP/Veloci/LCL164-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LCL164-1.p.ma
@@ -79,7 +79,7 @@ theorem prove_wajsberg_axiom:
 \forall H12:\forall X:Univ.eq Univ (not X) (xor X truth).eq Univ (implies (implies (not x) (not y)) (implies y x)) truth
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LDA001-1.p.ma b/matita/tests/TPTP/Veloci/LDA001-1.p.ma
index 051af57e853fe500be7000f8c047c7e8d8e05c6a..48e8b32cc07b0704ee70962c19370bddac7cec6e 100644 (file)
--- a/matita/tests/TPTP/Veloci/LDA001-1.p.ma
+++ b/matita/tests/TPTP/Veloci/LDA001-1.p.ma
@@ -36,7 +36,7 @@ theorem prove_equation:
 \forall H3:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (f X (f Y Z)) (f (f X Y) (f X Z)).eq Univ (f (f n3 n2) u) (f (f u u) u)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/LDA007-3.p.ma b/matita/tests/TPTP/Veloci/LDA007-3.p.ma
index 11d43b6a2bb112b4842705ecae83bb14b05c2e9d..534a5a9fd88d169f3c2549d89a988ae0ef305bfa 100644 (file)
--- a/matita/tests/TPTP/Veloci/LDA007-3.p.ma
+++ b/matita/tests/TPTP/Veloci/LDA007-3.p.ma
@@ -44,7 +44,7 @@ theorem prove_equation:
 \forall H5:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (f X (f Y Z)) (f (f X Y) (f X Z)).eq Univ (f t tsk) (f tt_ts tk)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/RNG007-4.p.ma b/matita/tests/TPTP/Veloci/RNG007-4.p.ma
index e981ee5ba591fab1776750e5e12e555f1e455230..a9cdabd1d2617b6e04d8e369b5b6f85fba76e45f 100644 (file)
--- a/matita/tests/TPTP/Veloci/RNG007-4.p.ma
+++ b/matita/tests/TPTP/Veloci/RNG007-4.p.ma
@@ -83,7 +83,7 @@ theorem prove_inverse:
 \forall H14:\forall X:Univ.eq Univ (add additive_identity X) X.eq Univ (add a a) additive_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/RNG008-4.p.ma b/matita/tests/TPTP/Veloci/RNG008-4.p.ma
index 26341ce46275bc22b9ed069e9540e0d9f707e910..c56142d6257e588d20ba4b26b60f03522e065677 100644 (file)
--- a/matita/tests/TPTP/Veloci/RNG008-4.p.ma
+++ b/matita/tests/TPTP/Veloci/RNG008-4.p.ma
@@ -87,7 +87,7 @@ theorem prove_commutativity:
 \forall H15:\forall X:Univ.eq Univ (add additive_identity X) X.eq Univ (multiply b a) c
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/RNG011-5.p.ma b/matita/tests/TPTP/Veloci/RNG011-5.p.ma
index fcf4367135a9c035b74bfa28340d4be475cd88e9..f7df33340e49c9e2a9b72db69418c0a23df17cef 100644 (file)
--- a/matita/tests/TPTP/Veloci/RNG011-5.p.ma
+++ b/matita/tests/TPTP/Veloci/RNG011-5.p.ma
@@ -76,7 +76,7 @@ theorem prove_equality:
 \forall H20:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (multiply (multiply (associator a a b) a) (associator a a b)) additive_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/RNG023-6.p.ma b/matita/tests/TPTP/Veloci/RNG023-6.p.ma
index 8397d426f5b7e7d3389943389ea96491748609cc..e69e4034585476e887b5407aa1870645cd782adc 100644 (file)
--- a/matita/tests/TPTP/Veloci/RNG023-6.p.ma
+++ b/matita/tests/TPTP/Veloci/RNG023-6.p.ma
@@ -84,7 +84,7 @@ theorem prove_left_alternative:
 \forall H14:\forall X:Univ.eq Univ (add additive_identity X) X.eq Univ (associator x x y) additive_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/RNG023-7.p.ma b/matita/tests/TPTP/Veloci/RNG023-7.p.ma
index 01e94c6a7426358985969b3e66482c9cccedc779..49260d096d2d01d06db105dee28f5daec6ce5f0a 100644 (file)
--- a/matita/tests/TPTP/Veloci/RNG023-7.p.ma
+++ b/matita/tests/TPTP/Veloci/RNG023-7.p.ma
@@ -92,7 +92,7 @@ theorem prove_left_alternative:
 \forall H21:\forall X:Univ.eq Univ (add additive_identity X) X.eq Univ (associator x x y) additive_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/RNG024-6.p.ma b/matita/tests/TPTP/Veloci/RNG024-6.p.ma
index 3785a9204f832cd5eea848e4f85a6c6dd9c01186..bdb4c04a72f82210e7264a222dd3cd67dedca1ab 100644 (file)
--- a/matita/tests/TPTP/Veloci/RNG024-6.p.ma
+++ b/matita/tests/TPTP/Veloci/RNG024-6.p.ma
@@ -84,7 +84,7 @@ theorem prove_right_alternative:
 \forall H14:\forall X:Univ.eq Univ (add additive_identity X) X.eq Univ (associator x y y) additive_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/RNG024-7.p.ma b/matita/tests/TPTP/Veloci/RNG024-7.p.ma
index 135db3ff2e84de52f111fa7efb3d1120dd4348bf..afb63d9f627e4ea20f3db5ea18d59c6824bd7ede 100644 (file)
--- a/matita/tests/TPTP/Veloci/RNG024-7.p.ma
+++ b/matita/tests/TPTP/Veloci/RNG024-7.p.ma
@@ -92,7 +92,7 @@ theorem prove_right_alternative:
 \forall H21:\forall X:Univ.eq Univ (add additive_identity X) X.eq Univ (associator x y y) additive_identity
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/ROB002-1.p.ma b/matita/tests/TPTP/Veloci/ROB002-1.p.ma
index 883467d612c5502ca568b9db7671d7499d67e63d..81aabc975393cee85a486878c2f035db7e49a3f8 100644 (file)
--- a/matita/tests/TPTP/Veloci/ROB002-1.p.ma
+++ b/matita/tests/TPTP/Veloci/ROB002-1.p.ma
@@ -59,7 +59,7 @@ theorem prove_huntingtons_axiom:
 \forall H3:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add (negate (add a (negate b))) (negate (add (negate a) (negate b)))) b
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/ROB009-1.p.ma b/matita/tests/TPTP/Veloci/ROB009-1.p.ma
index 90f1c10c9b42ac455bd5545379a98d232cdb6c0b..e3e2ad2b4e29a60c126aad7ef985a6fc476f034d 100644 (file)
--- a/matita/tests/TPTP/Veloci/ROB009-1.p.ma
+++ b/matita/tests/TPTP/Veloci/ROB009-1.p.ma
@@ -58,7 +58,7 @@ theorem prove_result:
 \forall H3:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ a b
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/ROB010-1.p.ma b/matita/tests/TPTP/Veloci/ROB010-1.p.ma
index 7658986681a86f9ddfb82531c54a6e6223656c7e..76f06f1af98ae95a3015d3a204ad43a70bdf448c 100644 (file)
--- a/matita/tests/TPTP/Veloci/ROB010-1.p.ma
+++ b/matita/tests/TPTP/Veloci/ROB010-1.p.ma
@@ -60,7 +60,7 @@ theorem prove_result:
 \forall H3:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (negate (add c (negate (add b a)))) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/ROB013-1.p.ma b/matita/tests/TPTP/Veloci/ROB013-1.p.ma
index fe79d15506511fd9cbdac8556fae56d07c2b5d8c..3039f34122ad81f71fca31fe75c9d30e1bb5d8d6 100644 (file)
--- a/matita/tests/TPTP/Veloci/ROB013-1.p.ma
+++ b/matita/tests/TPTP/Veloci/ROB013-1.p.ma
@@ -58,7 +58,7 @@ theorem prove_result:
 \forall H3:\forall X:Univ.\forall Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (negate (add c (negate (add (negate b) a)))) a
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.

diff --git a/matita/tests/TPTP/Veloci/ROB030-1.p.ma b/matita/tests/TPTP/Veloci/ROB030-1.p.ma
index 9868ec4d5dd564ce4406cfcf8a4473614b835be1..72fe9de94fff2f735ccd78dd5441b69944c8508d 100644 (file)
--- a/matita/tests/TPTP/Veloci/ROB030-1.p.ma
+++ b/matita/tests/TPTP/Veloci/ROB030-1.p.ma
@@ -64,7 +64,7 @@ exists[
 2:
 exists[
 2:
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 |
 skip]

diff --git a/matita/tests/TPTP/Veloci/SYN083-1.p.ma b/matita/tests/TPTP/Veloci/SYN083-1.p.ma
index 1dc7202c9f28e5339a212ceb8199a4b578d227f9..c8ac354f034b32c6907a9cce4f4a8ffb24d7b222 100644 (file)
--- a/matita/tests/TPTP/Veloci/SYN083-1.p.ma
+++ b/matita/tests/TPTP/Veloci/SYN083-1.p.ma
@@ -31,7 +31,7 @@ theorem prove_this:
 \forall H0:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (f X (f Y Z)) (f (f X Y) Z).eq Univ (f a (f b (f c d))) (f (f (f a b) c) d)
 .
 intros.
-autobatch paramodulation timeout=100.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.