X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FROB006-1.ma;h=06e8d7c0072bc8b3b67b6068263aadc12519693a;hb=0f13d14b63b012e0ea8ce0d0e71bf808fdd444eb;hp=dc48108180a6377a3d53a376b3d12deeb2bcd1ab;hpb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;p=helm.git diff --git a/helm/software/matita/contribs/ng_TPTP/ROB006-1.ma b/helm/software/matita/contribs/ng_TPTP/ROB006-1.ma index dc4810818..06e8d7c00 100644 --- a/helm/software/matita/contribs/ng_TPTP/ROB006-1.ma +++ b/helm/software/matita/contribs/ng_TPTP/ROB006-1.ma @@ -4,7 +4,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) -(* File : ROB006-1 : TPTP v3.2.0. Released v1.0.0. *) +(* File : ROB006-1 : TPTP v3.7.0. Released v1.0.0. *) (* Domain : Robbins Algebra *) @@ -34,7 +34,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.3.0, 1.00 v2.0.0 *) +(* Rating : 0.78 v3.4.0, 0.88 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.3.0, 1.00 v2.0.0 *) (* Syntax : Number of clauses : 5 ( 0 non-Horn; 5 unit; 2 RR) *) @@ -62,7 +62,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) -(* File : ROB001-0 : TPTP v3.2.0. Released v1.0.0. *) +(* File : ROB001-0 : TPTP v3.7.0. Released v1.0.0. *) (* Domain : Robbins algebra *) @@ -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) *) @@ -104,7 +104,7 @@ include "logic/equality.ma". (* -------------------------------------------------------------------------- *) ntheorem prove_huntingtons_axiom: - ∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ. + (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ. ∀a:Univ. ∀add:∀_:Univ.∀_:Univ.Univ. ∀b:Univ. @@ -114,23 +114,24 @@ ntheorem prove_huntingtons_axiom: ∀H0:eq Univ (add c d) d. ∀H1:∀X:Univ.∀Y:Univ.eq Univ (negate (add (negate (add X Y)) (negate (add X (negate Y))))) X. ∀H2:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (add (add X Y) Z) (add X (add Y Z)). -∀H3:∀X:Univ.∀Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add (negate (add a (negate b))) (negate (add (negate a) (negate b)))) b +∀H3:∀X:Univ.∀Y:Univ.eq Univ (add X Y) (add Y X).eq Univ (add (negate (add a (negate b))) (negate (add (negate a) (negate b)))) b) . -#Univ. -#X. -#Y. -#Z. -#a. -#add. -#b. -#c. -#d. -#negate. -#H0. -#H1. -#H2. -#H3. -nauto by H0,H1,H2,H3; +#Univ ##. +#X ##. +#Y ##. +#Z ##. +#a ##. +#add ##. +#b ##. +#c ##. +#d ##. +#negate ##. +#H0 ##. +#H1 ##. +#H2 ##. +#H3 ##. +nauto by H0,H1,H2,H3 ##; +ntry (nassumption) ##; nqed. (* -------------------------------------------------------------------------- *)