X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=matita%2Ftests%2FTPTP%2FVeloci%2FLDA007-3.p.ma;fp=matita%2Ftests%2FTPTP%2FVeloci%2FLDA007-3.p.ma;h=1aeda095a45cd1470bd8a1019bd9e8cc018496d1;hp=0000000000000000000000000000000000000000;hb=f61af501fb4608cc4fb062a0864c774e677f0d76;hpb=58ae1809c352e71e7b5530dc41e2bfc834e1aef1

diff --git a/matita/tests/TPTP/Veloci/LDA007-3.p.ma b/matita/tests/TPTP/Veloci/LDA007-3.p.ma
new file mode 100644
index 000000000..1aeda095a
--- /dev/null
+++ b/matita/tests/TPTP/Veloci/LDA007-3.p.ma
@@ -0,0 +1,51 @@
+
+include "logic/equality.ma".
+(* Inclusion of: LDA007-3.p *)
+(* -------------------------------------------------------------------------- *)
+(*  File     : LDA007-3 : TPTP v3.1.1. Released v1.0.0. *)
+(*  Domain   : LD-Algebras (Embedding algebras) *)
+(*  Problem  : Let g = cr(t). Show that t(tsg) = tt(ts)(tg)  *)
+(*  Version  : [Jec93] axioms : Incomplete > Reduced & Augmented > Incomplete. *)
+(*  English  :  *)
+(*  Refs     : [Jec93] Jech (1993), LD-Algebras *)
+(*  Source   : [Jec93] *)
+(*  Names    : Problem 8 [Jec93] *)
+(*  Status   : Unsatisfiable *)
+(*  Rating   : 0.00 v2.2.1, 0.11 v2.2.0, 0.14 v2.1.0, 0.13 v2.0.0 *)
+(*  Syntax   : Number of clauses     :    7 (   0 non-Horn;   7 unit;   6 RR) *)
+(*             Number of atoms       :    7 (   7 equality) *)
+(*             Maximal clause size   :    1 (   1 average) *)
+(*             Number of predicates  :    1 (   0 propositional; 2-2 arity) *)
+(*             Number of functors    :    9 (   8 constant; 0-2 arity) *)
+(*             Number of variables   :    3 (   0 singleton) *)
+(*             Maximal term depth    :    3 (   2 average) *)
+(*  Comments :  *)
+(* -------------------------------------------------------------------------- *)
+(* ----Include Embedding algebra axioms  *)
+(*  include('Axioms/LDA001-0.ax'). *)
+(* -------------------------------------------------------------------------- *)
+(* ----t(tsk) = tt(ts)(tk), where k=crit(t)  *)
+theorem prove_equation:
+ \forall Univ:Set.
+\forall f:\forall _:Univ.\forall _:Univ.Univ.
+\forall k:Univ.
+\forall s:Univ.
+\forall t:Univ.
+\forall tk:Univ.
+\forall ts:Univ.
+\forall tsk:Univ.
+\forall tt:Univ.
+\forall tt_ts:Univ.
+\forall H0:eq Univ tsk (f ts k).
+\forall H1:eq Univ tk (f t k).
+\forall H2:eq Univ tt_ts (f tt ts).
+\forall H3:eq Univ ts (f t s).
+\forall H4:eq Univ tt (f t t).
+\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;
+try assumption.
+print proofterm.
+qed.
+(* -------------------------------------------------------------------------- *)