X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FBOO101-1.ma;fp=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FBOO101-1.ma;h=22281b576bd6c9639cdcb56826dc0906476660f7;hb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;hp=0000000000000000000000000000000000000000;hpb=b7587a7dd68463086e8a6b7c14f10c1dc33f64ba;p=helm.git

diff --git a/helm/software/matita/contribs/ng_TPTP/BOO101-1.ma b/helm/software/matita/contribs/ng_TPTP/BOO101-1.ma
new file mode 100644
index 000000000..22281b576
--- /dev/null
+++ b/helm/software/matita/contribs/ng_TPTP/BOO101-1.ma
@@ -0,0 +1,64 @@
+include "logic/equality.ma".
+
+(* Inclusion of: BOO101-1.p *)
+
+(* -------------------------------------------------------------------------- *)
+
+(*  File     : BOO101-1 : TPTP v3.2.0. Released v2.6.0. *)
+
+(*  Domain   : Boolean Algebra *)
+
+(*  Problem  : Axiom C13 for Boolean algebra in the Sheffer stroke, part 1 *)
+
+(*  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    :    3 (   2 constant; 0-2 arity) *)
+
+(*             Number of variables   :    3 (   1 singleton) *)
+
+(*             Maximal term depth    :    5 (   2 average) *)
+
+(*  Comments : A UEQ part of BOO052-1 *)
+
+(* -------------------------------------------------------------------------- *)
+ntheorem prove_meredith_2_basis_1:
+ ∀Univ:Type.∀A:Univ.∀B:Univ.∀C:Univ.
+∀a:Univ.
+∀b:Univ.
+∀nand:∀_:Univ.∀_:Univ.Univ.
+∀H0:∀A:Univ.∀B:Univ.∀C:Univ.eq Univ (nand (nand (nand (nand A B) A) A) (nand B (nand C A))) B.eq Univ (nand (nand a a) (nand b a)) a
+.
+#Univ.
+#A.
+#B.
+#C.
+#a.
+#b.
+#nand.
+#H0.
+nauto by H0;
+nqed.
+
+(* -------------------------------------------------------------------------- *)