X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FGRP186-3.ma;h=d21ff8cb72b74f3be58a21265ecf3e2dee7515dc;hb=ea5d9548f89f6e9570c6c37be2457bc5e1c59740;hp=8ce7ed2dc32b45272dbe37da43d29d793a7162e3;hpb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;p=helm.git diff --git a/helm/software/matita/contribs/ng_TPTP/GRP186-3.ma b/helm/software/matita/contribs/ng_TPTP/GRP186-3.ma index 8ce7ed2dc..d21ff8cb7 100644 --- a/helm/software/matita/contribs/ng_TPTP/GRP186-3.ma +++ b/helm/software/matita/contribs/ng_TPTP/GRP186-3.ma @@ -4,7 +4,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) -(* File : GRP186-3 : TPTP v3.2.0. Bugfixed v1.2.1. *) +(* File : GRP186-3 : TPTP v3.7.0. Bugfixed v1.2.1. *) (* Domain : Group Theory (Lattice Ordered) *) @@ -60,7 +60,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) -(* File : GRP004-0 : TPTP v3.2.0. Released v1.0.0. *) +(* File : GRP004-0 : TPTP v3.7.0. Released v1.0.0. *) (* Domain : Group Theory *) @@ -84,7 +84,7 @@ include "logic/equality.ma". (* Syntax : Number of clauses : 3 ( 0 non-Horn; 3 unit; 0 RR) *) -(* Number of literals : 3 ( 3 equality) *) +(* Number of atoms : 3 ( 3 equality) *) (* Maximal clause size : 1 ( 1 average) *) @@ -126,7 +126,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) -(* File : GRP004-2 : TPTP v3.2.0. Bugfixed v1.2.0. *) +(* File : GRP004-2 : TPTP v3.7.0. Bugfixed v1.2.0. *) (* Domain : Group Theory (Lattice Ordered) *) @@ -148,7 +148,7 @@ include "logic/equality.ma". (* Syntax : Number of clauses : 12 ( 0 non-Horn; 12 unit; 0 RR) *) -(* Number of literals : 12 ( 12 equality) *) +(* Number of atoms : 12 ( 12 equality) *) (* Maximal clause size : 1 ( 1 average) *) @@ -172,7 +172,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) ntheorem prove_p23x: - ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ. + (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ. ∀a:Univ. ∀b:Univ. ∀greatest_lower_bound:∀_:Univ.∀_:Univ.Univ. @@ -194,35 +194,36 @@ ntheorem prove_p23x: ∀H11:∀X:Univ.∀Y:Univ.eq Univ (greatest_lower_bound X Y) (greatest_lower_bound Y X). ∀H12:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply (multiply X Y) Z) (multiply X (multiply Y Z)). ∀H13:∀X:Univ.eq Univ (multiply (inverse X) X) identity. -∀H14:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (multiply a b) identity) (multiply a (least_upper_bound (inverse a) b)) +∀H14:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound (multiply a b) identity) (multiply a (least_upper_bound (inverse a) b))) . -#Univ. -#X. -#Y. -#Z. -#a. -#b. -#greatest_lower_bound. -#identity. -#inverse. -#least_upper_bound. -#multiply. -#H0. -#H1. -#H2. -#H3. -#H4. -#H5. -#H6. -#H7. -#H8. -#H9. -#H10. -#H11. -#H12. -#H13. -#H14. -nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14; +#Univ ##. +#X ##. +#Y ##. +#Z ##. +#a ##. +#b ##. +#greatest_lower_bound ##. +#identity ##. +#inverse ##. +#least_upper_bound ##. +#multiply ##. +#H0 ##. +#H1 ##. +#H2 ##. +#H3 ##. +#H4 ##. +#H5 ##. +#H6 ##. +#H7 ##. +#H8 ##. +#H9 ##. +#H10 ##. +#H11 ##. +#H12 ##. +#H13 ##. +#H14 ##. +nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14 ##; +ntry (nassumption) ##; nqed. (* -------------------------------------------------------------------------- *)