X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FGRP182-2.ma;h=f1d5f7ee8dcc24f60007bcf4113c20041cd85319;hb=e880d6eab5e1700f4a625ddcd7d0fa8f0cce2dcc;hp=bb7057f22ad9ab70dd50feefcd4575986483ae24;hpb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;p=helm.git diff --git a/helm/software/matita/contribs/ng_TPTP/GRP182-2.ma b/helm/software/matita/contribs/ng_TPTP/GRP182-2.ma index bb7057f22..f1d5f7ee8 100644 --- a/helm/software/matita/contribs/ng_TPTP/GRP182-2.ma +++ b/helm/software/matita/contribs/ng_TPTP/GRP182-2.ma @@ -4,7 +4,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) -(* File : GRP182-2 : TPTP v3.2.0. Bugfixed v1.2.1. *) +(* File : GRP182-2 : TPTP v3.7.0. Bugfixed v1.2.1. *) (* Domain : Group Theory (Lattice Ordered) *) @@ -64,7 +64,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 *) @@ -88,7 +88,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) *) @@ -130,7 +130,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) *) @@ -152,7 +152,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) *) @@ -186,7 +186,7 @@ include "logic/equality.ma". (* ----This is Dahn's clause *) ntheorem prove_p17a: - ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ. + (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ. ∀a:Univ. ∀greatest_lower_bound:∀_:Univ.∀_:Univ.Univ. ∀identity:Univ. @@ -210,37 +210,38 @@ ntheorem prove_p17a: ∀H14:∀X:Univ.∀Y:Univ.eq Univ (greatest_lower_bound X Y) (greatest_lower_bound Y X). ∀H15:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply (multiply X Y) Z) (multiply X (multiply Y Z)). ∀H16:∀X:Univ.eq Univ (multiply (inverse X) X) identity. -∀H17:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound identity (greatest_lower_bound a identity)) identity +∀H17:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (least_upper_bound identity (greatest_lower_bound a identity)) identity) . -#Univ. -#X. -#Y. -#Z. -#a. -#greatest_lower_bound. -#identity. -#inverse. -#least_upper_bound. -#multiply. -#H0. -#H1. -#H2. -#H3. -#H4. -#H5. -#H6. -#H7. -#H8. -#H9. -#H10. -#H11. -#H12. -#H13. -#H14. -#H15. -#H16. -#H17. -nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14,H15,H16,H17; +#Univ ##. +#X ##. +#Y ##. +#Z ##. +#a ##. +#greatest_lower_bound ##. +#identity ##. +#inverse ##. +#least_upper_bound ##. +#multiply ##. +#H0 ##. +#H1 ##. +#H2 ##. +#H3 ##. +#H4 ##. +#H5 ##. +#H6 ##. +#H7 ##. +#H8 ##. +#H9 ##. +#H10 ##. +#H11 ##. +#H12 ##. +#H13 ##. +#H14 ##. +#H15 ##. +#H16 ##. +#H17 ##. +nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14,H15,H16,H17 ##; +ntry (nassumption) ##; nqed. (* -------------------------------------------------------------------------- *)