X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Fng_TPTP%2FBOO084-1.ma;fp=matita%2Fmatita%2Fcontribs%2Fng_TPTP%2FBOO084-1.ma;h=f4de000005645802983bca0c29930c1e362fbaf8;hb=2c01ff6094173915e7023076ea48b5804dca7778;hp=0000000000000000000000000000000000000000;hpb=a050e3f80d7ea084ce0184279af98e8251c7d2a6;p=helm.git

diff --git a/matita/matita/contribs/ng_TPTP/BOO084-1.ma b/matita/matita/contribs/ng_TPTP/BOO084-1.ma
new file mode 100644
index 000000000..f4de00000
--- /dev/null
+++ b/matita/matita/contribs/ng_TPTP/BOO084-1.ma
@@ -0,0 +1,67 @@
+include "logic/equality.ma".
+
+(* Inclusion of: BOO084-1.p *)
+
+(* -------------------------------------------------------------------------- *)
+
+(*  File     : BOO084-1 : TPTP v3.7.0. Released v2.6.0. *)
+
+(*  Domain   : Boolean Algebra *)
+
+(*  Problem  : Axiom C4 for Boolean algebra in the Sheffer stroke, part 2 *)
+
+(*  Version  : [EF+02] axioms. *)
+
+(*  English  :  *)
+
+(*  Refs     : [EF+02] Ernst et al. (2002), More First-order Test Problems in *)
+
+(*           : [MV+02] McCune et al. (2002), Short Single Axioms for Boolean *)
+
+(*  Source   : [TPTP] *)
+
+(*  Names    :  *)
+
+(*  Status   : Unknown *)
+
+(*  Rating   : 1.00 v2.6.0 *)
+
+(*  Syntax   : Number of clauses     :    2 (   0 non-Horn;   2 unit;   1 RR) *)
+
+(*             Number of atoms       :    2 (   2 equality) *)
+
+(*             Maximal clause size   :    1 (   1 average) *)
+
+(*             Number of predicates  :    1 (   0 propositional; 2-2 arity) *)
+
+(*             Number of functors    :    4 (   3 constant; 0-2 arity) *)
+
+(*             Number of variables   :    3 (   1 singleton) *)
+
+(*             Maximal term depth    :    5 (   4 average) *)
+
+(*  Comments : A UEQ part of BOO043-1 *)
+
+(* -------------------------------------------------------------------------- *)
+ntheorem prove_meredith_2_basis_2:
+ (∀Univ:Type.∀A:Univ.∀B:Univ.∀C:Univ.
+∀a:Univ.
+∀b:Univ.
+∀c:Univ.
+∀nand:∀_:Univ.∀_:Univ.Univ.
+∀H0:∀A:Univ.∀B:Univ.∀C:Univ.eq Univ (nand (nand A (nand A (nand A B))) (nand B (nand A C))) B.eq Univ (nand a (nand b (nand a c))) (nand (nand (nand c b) b) a))
+.
+#Univ ##.
+#A ##.
+#B ##.
+#C ##.
+#a ##.
+#b ##.
+#c ##.
+#nand ##.
+#H0 ##.
+nauto by H0 ##;
+ntry (nassumption) ##;
+nqed.
+
+(* -------------------------------------------------------------------------- *)