X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FRNG029-5.ma;h=633124c8b46de05bed8d774bc2f96e9742a93514;hb=02e8b3eb9d2a8a3bb3942c41b47b6ac048efd5be;hp=f95752bb3b1f79f7a7e4952f106879e4c50f396f;hpb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;p=helm.git diff --git a/helm/software/matita/contribs/ng_TPTP/RNG029-5.ma b/helm/software/matita/contribs/ng_TPTP/RNG029-5.ma index f95752bb3..633124c8b 100644 --- a/helm/software/matita/contribs/ng_TPTP/RNG029-5.ma +++ b/helm/software/matita/contribs/ng_TPTP/RNG029-5.ma @@ -4,7 +4,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) -(* File : RNG029-5 : TPTP v3.2.0. Released v1.0.0. *) +(* File : RNG029-5 : TPTP v3.7.0. Released v1.0.0. *) (* Domain : Ring Theory (Alternative) *) @@ -24,7 +24,7 @@ include "logic/equality.ma". (* Status : Unsatisfiable *) -(* Rating : 0.86 v3.1.0, 0.89 v2.7.0, 0.91 v2.6.0, 0.83 v2.5.0, 0.75 v2.4.0, 0.67 v2.2.1, 1.00 v2.0.0 *) +(* Rating : 0.78 v3.4.0, 0.75 v3.3.0, 0.86 v3.1.0, 0.89 v2.7.0, 0.91 v2.6.0, 0.83 v2.5.0, 0.75 v2.4.0, 0.67 v2.2.1, 1.00 v2.0.0 *) (* Syntax : Number of clauses : 16 ( 0 non-Horn; 16 unit; 1 RR) *) @@ -54,7 +54,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) *) @@ -74,7 +74,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". (* -------------------------------------------------------------------------- *) ntheorem prove_middle_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. @@ -140,37 +140,38 @@ ntheorem prove_middle_law: ∀H11:∀X:Univ.eq Univ (multiply X additive_identity) additive_identity. ∀H12:∀X:Univ.eq Univ (multiply additive_identity X) additive_identity. ∀H13:∀X:Univ.eq Univ (add X additive_identity) X. -∀H14:∀X:Univ.eq Univ (add additive_identity X) X.eq Univ (multiply (multiply cx cy) (multiply cz cx)) (multiply cx (multiply (multiply cy cz) cx)) +∀H14:∀X:Univ.eq Univ (add additive_identity X) X.eq Univ (multiply (multiply cx cy) (multiply cz cx)) (multiply cx (multiply (multiply cy cz) cx))) . -#Univ. -#X. -#Y. -#Z. -#add. -#additive_identity. -#additive_inverse. -#associator. -#commutator. -#cx. -#cy. -#cz. -#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 ##. +#add ##. +#additive_identity ##. +#additive_inverse ##. +#associator ##. +#commutator ##. +#cx ##. +#cy ##. +#cz ##. +#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. (* -------------------------------------------------------------------------- *)