X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FGRP179-1.ma;h=ed0858cc96b923de4dff9dcf988b722809bdce7d;hb=ced2abc1e3fe84d5bbfa9ccb2ebf46f253279ebe;hp=2e41855c69ea7ddc63cd8455fd30ce55f076239d;hpb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;p=helm.git diff --git a/helm/software/matita/contribs/ng_TPTP/GRP179-1.ma b/helm/software/matita/contribs/ng_TPTP/GRP179-1.ma index 2e41855c6..ed0858cc9 100644 --- a/helm/software/matita/contribs/ng_TPTP/GRP179-1.ma +++ b/helm/software/matita/contribs/ng_TPTP/GRP179-1.ma @@ -4,7 +4,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) -(* File : GRP179-1 : TPTP v3.2.0. Bugfixed v1.2.1. *) +(* File : GRP179-1 : TPTP v3.7.0. Bugfixed v1.2.1. *) (* Domain : Group Theory (Lattice Ordered) *) @@ -26,7 +26,7 @@ include "logic/equality.ma". (* Status : Unsatisfiable *) -(* Rating : 0.50 v3.1.0, 0.44 v2.7.0, 0.45 v2.6.0, 0.50 v2.5.0, 0.25 v2.4.0, 0.00 v2.2.1, 0.78 v2.2.0, 0.86 v2.1.0, 0.86 v2.0.0 *) +(* Rating : 0.44 v3.4.0, 0.50 v3.1.0, 0.44 v2.7.0, 0.45 v2.6.0, 0.50 v2.5.0, 0.25 v2.4.0, 0.00 v2.2.1, 0.78 v2.2.0, 0.86 v2.1.0, 0.86 v2.0.0 *) (* Syntax : Number of clauses : 16 ( 0 non-Horn; 16 unit; 1 RR) *) @@ -58,7 +58,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 *) @@ -82,7 +82,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) *) @@ -124,7 +124,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) *) @@ -146,7 +146,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) *) @@ -170,7 +170,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) ntheorem prove_p10: - ∀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. @@ -192,35 +192,36 @@ ntheorem prove_p10: ∀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 (inverse (least_upper_bound a b)) (greatest_lower_bound (inverse a) (inverse b)) +∀H14:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (inverse (least_upper_bound a b)) (greatest_lower_bound (inverse a) (inverse 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. (* -------------------------------------------------------------------------- *)