X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Ftests%2FTPTP%2FVeloci%2FGRP517-1.p.ma;h=e268d2534e0b5a087409f015648c196d603ac05d;hb=df1c68cd483823071179fb74428de36f21c20972;hp=ee9bff2fc5e764654976c5fd72f49937992fe076;hpb=6558b3742901cee9fe47fa2dd204c365f57a89a8;p=helm.git

diff --git a/helm/software/matita/tests/TPTP/Veloci/GRP517-1.p.ma b/helm/software/matita/tests/TPTP/Veloci/GRP517-1.p.ma
index ee9bff2fc..e268d2534 100644
--- a/helm/software/matita/tests/TPTP/Veloci/GRP517-1.p.ma
+++ b/helm/software/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.
-auto paramodulation timeout=100.
+autobatch paramodulation timeout=100.
 try assumption.
 print proofterm.
 qed.