X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FRNG025-7.ma;h=b2446f77c0b8e186b4f95e9ab192073f41e600bb;hb=bbf85ddcdfe0809fee0c6ca9812ce0da30c238af;hp=103e8a59d4eba0ba1b5766c40698c88b2dd4bc59;hpb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;p=helm.git diff --git a/helm/software/matita/contribs/ng_TPTP/RNG025-7.ma b/helm/software/matita/contribs/ng_TPTP/RNG025-7.ma index 103e8a59d..b2446f77c 100644 --- a/helm/software/matita/contribs/ng_TPTP/RNG025-7.ma +++ b/helm/software/matita/contribs/ng_TPTP/RNG025-7.ma @@ -4,7 +4,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) -(* File : RNG025-7 : TPTP v3.2.0. Released v1.0.0. *) +(* File : RNG025-7 : TPTP v3.7.0. Released v1.0.0. *) (* Domain : Ring Theory (Alternative) *) @@ -26,7 +26,7 @@ include "logic/equality.ma". (* Status : Unsatisfiable *) -(* Rating : 0.36 v3.2.0, 0.43 v3.1.0, 0.56 v2.7.0, 0.55 v2.6.0, 0.67 v2.5.0, 0.75 v2.4.0, 0.67 v2.2.1, 0.89 v2.2.0, 0.86 v2.1.0, 0.88 v2.0.0 *) +(* Rating : 0.44 v3.4.0, 0.50 v3.3.0, 0.36 v3.2.0, 0.43 v3.1.0, 0.56 v2.7.0, 0.55 v2.6.0, 0.67 v2.5.0, 0.75 v2.4.0, 0.67 v2.2.1, 0.89 v2.2.0, 0.86 v2.1.0, 0.88 v2.0.0 *) (* Syntax : Number of clauses : 23 ( 0 non-Horn; 23 unit; 1 RR) *) @@ -52,7 +52,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) -(* File : RNG003-0 : TPTP v3.2.0. Released v1.0.0. *) +(* File : RNG003-0 : TPTP v3.7.0. Released v1.0.0. *) (* Domain : Ring Theory (Alternative) *) @@ -72,7 +72,7 @@ include "logic/equality.ma". (* Syntax : Number of clauses : 15 ( 0 non-Horn; 15 unit; 0 RR) *) -(* Number of literals : 15 ( 15 equality) *) +(* Number of atoms : 15 ( 15 equality) *) (* Maximal clause size : 1 ( 1 average) *) @@ -116,7 +116,7 @@ include "logic/equality.ma". (* ----The next 7 clause are extra lemmas which Stevens found useful *) ntheorem prove_flexible_law: - ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ. + (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ. ∀add:∀_:Univ.∀_:Univ.Univ. ∀additive_identity:Univ. ∀additive_inverse:∀_:Univ.Univ. @@ -146,43 +146,44 @@ ntheorem prove_flexible_law: ∀H18:∀X:Univ.eq Univ (multiply X additive_identity) additive_identity. ∀H19:∀X:Univ.eq Univ (multiply additive_identity X) additive_identity. ∀H20:∀X:Univ.eq Univ (add X additive_identity) X. -∀H21:∀X:Univ.eq Univ (add additive_identity X) X.eq Univ (associator x y x) additive_identity +∀H21:∀X:Univ.eq Univ (add additive_identity X) X.eq Univ (associator x y x) additive_identity) . -#Univ. -#X. -#Y. -#Z. -#add. -#additive_identity. -#additive_inverse. -#associator. -#commutator. -#multiply. -#x. -#y. -#H0. -#H1. -#H2. -#H3. -#H4. -#H5. -#H6. -#H7. -#H8. -#H9. -#H10. -#H11. -#H12. -#H13. -#H14. -#H15. -#H16. -#H17. -#H18. -#H19. -#H20. -#H21. -nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14,H15,H16,H17,H18,H19,H20,H21; +#Univ ##. +#X ##. +#Y ##. +#Z ##. +#add ##. +#additive_identity ##. +#additive_inverse ##. +#associator ##. +#commutator ##. +#multiply ##. +#x ##. +#y ##. +#H0 ##. +#H1 ##. +#H2 ##. +#H3 ##. +#H4 ##. +#H5 ##. +#H6 ##. +#H7 ##. +#H8 ##. +#H9 ##. +#H10 ##. +#H11 ##. +#H12 ##. +#H13 ##. +#H14 ##. +#H15 ##. +#H16 ##. +#H17 ##. +#H18 ##. +#H19 ##. +#H20 ##. +#H21 ##. +nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14,H15,H16,H17,H18,H19,H20,H21 ##; +ntry (nassumption) ##; nqed. (* -------------------------------------------------------------------------- *)