X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;ds=sidebyside;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2Fng_TPTP%2FROB031-1.ma;h=6288ac3b1f0ce57196b1eb250ec5a0b2fe130a53;hb=e880d6eab5e1700f4a625ddcd7d0fa8f0cce2dcc;hp=2dac0a308d35904aa8fe9cc9a3767b1d511c9ebf;hpb=11e495dda047bcdfa4267c06cad2d074fcffe3e3;p=helm.git

diff --git a/helm/software/matita/contribs/ng_TPTP/ROB031-1.ma b/helm/software/matita/contribs/ng_TPTP/ROB031-1.ma
index 2dac0a308..6288ac3b1 100644
--- a/helm/software/matita/contribs/ng_TPTP/ROB031-1.ma
+++ b/helm/software/matita/contribs/ng_TPTP/ROB031-1.ma
@@ -4,7 +4,7 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 
-(*  File     : ROB031-1 : TPTP v3.2.0. Released v3.1.0. *)
+(*  File     : ROB031-1 : TPTP v3.7.0. Released v3.1.0. *)
 
 (*  Domain   : Robbins Algebra *)
 
@@ -54,7 +54,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 *)
 
@@ -76,7 +76,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) *)
 
@@ -96,33 +96,32 @@ include "logic/equality.ma".
 
 (* -------------------------------------------------------------------------- *)
 ntheorem prove_absorption_within_negation:
- ∀Univ:Type.∀A:Univ.∀B:Univ.∀X:Univ.∀Y:Univ.∀Z:Univ.
+ (∀Univ:Type.∀A:Univ.∀B:Univ.∀X:Univ.∀Y:Univ.∀Z:Univ.
 ∀add:∀_:Univ.∀_:Univ.Univ.
 ∀negate:∀_:Univ.Univ.
 ∀H0:∀X:Univ.∀Y:Univ.eq Univ (negate (add (negate (add X Y)) (negate (add X (negate Y))))) X.
 ∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (add (add X Y) Z) (add X (add Y Z)).
-∀H2:∀X:Univ.∀Y:Univ.eq Univ (add X Y) (add Y X).∃A:Univ.∃B:Univ.eq Univ (negate (add A B)) (negate B)
+∀H2:∀X:Univ.∀Y:Univ.eq Univ (add X Y) (add Y X).∃A:Univ.∃B:Univ.eq Univ (negate (add A B)) (negate B))
 .
-#Univ.
-#A.
-#B.
-#X.
-#Y.
-#Z.
-#add.
-#negate.
-#H0.
-#H1.
-#H2.
-napply ex_intro[
-nid2:
-napply ex_intro[
-nid2:
-nauto by H0,H1,H2;
-nid|
-skip]
-nid|
-skip]
+#Univ ##.
+#A ##.
+#B ##.
+#X ##.
+#Y ##.
+#Z ##.
+#add ##.
+#negate ##.
+#H0 ##.
+#H1 ##.
+#H2 ##.
+napply (ex_intro ? ? ? ?) ##[
+##2:
+napply (ex_intro ? ? ? ?) ##[
+##2:
+nauto by H0,H1,H2 ##;
+##| ##skip ##]
+##| ##skip ##]
+ntry (nassumption) ##;
 nqed.
 
 (* -------------------------------------------------------------------------- *)