X-Git-Url: http://matita.cs.unibo.it/gitweb/?p=helm.git;a=blobdiff_plain;f=matita%2Ftests%2FTPTP%2FVeloci%2FGRP615-1.p.ma;fp=matita%2Ftests%2FTPTP%2FVeloci%2FGRP615-1.p.ma;h=7be06ff728049da373bd7e5fa8cc35ddc5f8244f;hp=0000000000000000000000000000000000000000;hb=f61af501fb4608cc4fb062a0864c774e677f0d76;hpb=58ae1809c352e71e7b5530dc41e2bfc834e1aef1 diff --git a/matita/tests/TPTP/Veloci/GRP615-1.p.ma b/matita/tests/TPTP/Veloci/GRP615-1.p.ma new file mode 100644 index 000000000..7be06ff72 --- /dev/null +++ b/matita/tests/TPTP/Veloci/GRP615-1.p.ma @@ -0,0 +1,40 @@ + +include "logic/equality.ma". +(* Inclusion of: GRP615-1.p *) +(* -------------------------------------------------------------------------- *) +(* File : GRP615-1 : TPTP v3.1.1. Released v2.6.0. *) +(* Domain : Group Theory (Abelian) *) +(* Problem : Axiom for Abelian group theory, in double div and inv, part 3 *) +(* Version : [McC93] (equality) axioms. *) +(* English : *) +(* Refs : [McC93] McCune (1993), Single Axioms for Groups and Abelian Gr *) +(* Source : [TPTP] *) +(* Names : *) +(* Status : Unsatisfiable *) +(* Rating : 0.07 v3.1.0, 0.11 v2.7.0, 0.00 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 : 6 ( 3 constant; 0-2 arity) *) +(* Number of variables : 5 ( 0 singleton) *) +(* Maximal term depth : 7 ( 3 average) *) +(* Comments : A UEQ part of GRP111-1 *) +(* -------------------------------------------------------------------------- *) +theorem prove_these_axioms_3: + \forall Univ:Set. +\forall a3:Univ. +\forall b3:Univ. +\forall c3:Univ. +\forall double_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) (inverse (double_divide B A)). +\forall H1:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (double_divide (inverse (double_divide (inverse (double_divide A (inverse B))) C)) (double_divide A C)) B.eq Univ (multiply (multiply a3 b3) c3) (multiply a3 (multiply b3 c3)) +. +intros. +autobatch paramodulation timeout=100; +try assumption. +print proofterm. +qed. +(* -------------------------------------------------------------------------- *)