First attempt for refined goal selection strategy

[helm.git] / helm / software / matita / tests / TPTP / Veloci / LCL164-1.p.ma

diff --git a/helm/software/matita/tests/TPTP/Veloci/LCL164-1.p.ma b/helm/software/matita/tests/TPTP/Veloci/LCL164-1.p.ma
index 38d3ab4c5b542855be99c23121cae7726327793a..e5bc4b5135858837b5fdb10b127f325c342a57a4 100644 (file)
--- a/helm/software/matita/tests/TPTP/Veloci/LCL164-1.p.ma
+++ b/helm/software/matita/tests/TPTP/Veloci/LCL164-1.p.ma
@@ -1,4 +1,4 @@
-set "baseuri" "cic:/matita/TPTP/LCL164-1".
+
 include "logic/equality.ma".
 (* Inclusion of: LCL164-1.p *)
 (* -------------------------------------------------------------------------- *)
@@ -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.
-auto paramodulation timeout=600.
+autobatch paramodulation timeout=100;
 try assumption.
 print proofterm.
 qed.