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

diff --git a/matita/tests/TPTP/Veloci/GRP561-1.p.ma b/matita/tests/TPTP/Veloci/GRP561-1.p.ma
new file mode 100644
index 000000000..2ea4db80e
--- /dev/null
+++ b/matita/tests/TPTP/Veloci/GRP561-1.p.ma
@@ -0,0 +1,39 @@
+
+include "logic/equality.ma".
+(* Inclusion of: GRP561-1.p *)
+(* -------------------------------------------------------------------------- *)
+(*  File     : GRP561-1 : TPTP v3.1.1. Released v2.6.0. *)
+(*  Domain   : Group Theory (Abelian) *)
+(*  Problem  : Axiom for Abelian group theory, in division and inverse, part 1 *)
+(*  Version  : [McC93] (equality) axioms. *)
+(*  English  :  *)
+(*  Refs     : [McC93] McCune (1993), Single Axioms for Groups and Abelian Gr *)
+(*  Source   : [TPTP] *)
+(*  Names    :  *)
+(*  Status   : Unsatisfiable *)
+(*  Rating   : 0.00 v2.7.0, 0.09 v2.6.0 *)
+(*  Syntax   : Number of clauses     :    3 (   0 non-Horn;   3 unit;   1 RR) *)
+(*             Number of atoms       :    3 (   3 equality) *)
+(*             Maximal clause size   :    1 (   1 average) *)
+(*             Number of predicates  :    1 (   0 propositional; 2-2 arity) *)
+(*             Number of functors    :    5 (   2 constant; 0-2 arity) *)
+(*             Number of variables   :    5 (   0 singleton) *)
+(*             Maximal term depth    :    5 (   3 average) *)
+(*  Comments : A UEQ part of GRP098-1 *)
+(* -------------------------------------------------------------------------- *)
+theorem prove_these_axioms_1:
+ \forall Univ:Set.
+\forall a1:Univ.
+\forall b1:Univ.
+\forall divide:\forall _:Univ.\forall _:Univ.Univ.
+\forall inverse:\forall _:Univ.Univ.
+\forall multiply:\forall _:Univ.\forall _:Univ.Univ.
+\forall H0:\forall A:Univ.\forall B:Univ.eq Univ (multiply A B) (divide A (inverse B)).
+\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;
+try assumption.
+print proofterm.
+qed.
+(* -------------------------------------------------------------------------- *)