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

diff --git a/matita/tests/TPTP/Veloci/GRP023-2.p.ma b/matita/tests/TPTP/Veloci/GRP023-2.p.ma
new file mode 100644
index 000000000..c1a22f39a
--- /dev/null
+++ b/matita/tests/TPTP/Veloci/GRP023-2.p.ma
@@ -0,0 +1,75 @@
+
+include "logic/equality.ma".
+(* Inclusion of: GRP023-2.p *)
+(* -------------------------------------------------------------------------- *)
+(*  File     : GRP023-2 : TPTP v3.1.1. Released v1.0.0. *)
+(*  Domain   : Group Theory *)
+(*  Problem  : The inverse of the identity is the identity *)
+(*  Version  : [MOW76] (equality) axioms : Augmented. *)
+(*  English  :  *)
+(*  Refs     : [MOW76] McCharen et al. (1976), Problems and Experiments for a *)
+(*  Source   : [TPTP] *)
+(*  Names    : Established lemma [MOW76] *)
+(*  Status   : Unsatisfiable *)
+(*  Rating   : 0.00 v2.0.0 *)
+(*  Syntax   : Number of clauses     :    6 (   0 non-Horn;   6 unit;   1 RR) *)
+(*             Number of atoms       :    6 (   6 equality) *)
+(*             Maximal clause size   :    1 (   1 average) *)
+(*             Number of predicates  :    1 (   0 propositional; 2-2 arity) *)
+(*             Number of functors    :    3 (   1 constant; 0-2 arity) *)
+(*             Number of variables   :    7 (   0 singleton) *)
+(*             Maximal term depth    :    3 (   2 average) *)
+(*  Comments :  *)
+(* -------------------------------------------------------------------------- *)
+(* ----Include equality group theory axioms  *)
+(* Inclusion of: Axioms/GRP004-0.ax *)
+(* -------------------------------------------------------------------------- *)
+(*  File     : GRP004-0 : TPTP v3.1.1. Released v1.0.0. *)
+(*  Domain   : Group Theory *)
+(*  Axioms   : Group theory (equality) axioms *)
+(*  Version  : [MOW76] (equality) axioms :  *)
+(*             Reduced > Complete. *)
+(*  English  :  *)
+(*  Refs     : [MOW76] McCharen et al. (1976), Problems and Experiments for a *)
+(*           : [Wos88] Wos (1988), Automated Reasoning - 33 Basic Research Pr *)
+(*  Source   : [ANL] *)
+(*  Names    :  *)
+(*  Status   :  *)
+(*  Syntax   : Number of clauses    :    3 (   0 non-Horn;   3 unit;   0 RR) *)
+(*             Number of literals   :    3 (   3 equality) *)
+(*             Maximal clause size  :    1 (   1 average) *)
+(*             Number of predicates :    1 (   0 propositional; 2-2 arity) *)
+(*             Number of functors   :    3 (   1 constant; 0-2 arity) *)
+(*             Number of variables  :    5 (   0 singleton) *)
+(*             Maximal term depth   :    3 (   2 average) *)
+(*  Comments : [MOW76] also contains redundant right_identity and *)
+(*             right_inverse axioms. *)
+(*           : These axioms are also used in [Wos88] p.186, also with *)
+(*             right_identity and right_inverse. *)
+(* -------------------------------------------------------------------------- *)
+(* ----For any x and y in the group x*y is also in the group. No clause  *)
+(* ----is needed here since this is an instance of reflexivity  *)
+(* ----There exists an identity element  *)
+(* ----For any x in the group, there exists an element y such that x*y = y*x  *)
+(* ----= identity. *)
+(* ----The operation '*' is associative  *)
+(* -------------------------------------------------------------------------- *)
+(* -------------------------------------------------------------------------- *)
+(* ----Redundant two axioms *)
+theorem prove_inverse_of_id_is_id:
+ \forall Univ:Set.
+\forall identity:Univ.
+\forall inverse:\forall _:Univ.Univ.
+\forall multiply:\forall _:Univ.\forall _:Univ.Univ.
+\forall H0:\forall X:Univ.eq Univ (multiply X (inverse X)) identity.
+\forall H1:\forall X:Univ.eq Univ (multiply X identity) X.
+\forall H2:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (multiply (multiply X Y) Z) (multiply X (multiply Y Z)).
+\forall H3:\forall X:Univ.eq Univ (multiply (inverse X) X) identity.
+\forall H4:\forall X:Univ.eq Univ (multiply identity X) X.eq Univ (inverse identity) identity
+.
+intros.
+autobatch paramodulation timeout=100;
+try assumption.
+print proofterm.
+qed.
+(* -------------------------------------------------------------------------- *)